Week1-1Dynamic Connectivity

Steps to developing a usable algorithm


Given a set of N objects, main operations are:

-Union Command: Connect 2 objects: union( a, b )
-Find/Connected query: is there a path connecting the 2 objects? connect ( a, b )


Answer the question if there is a path between 2 points in the map, not to find out the path( in Part 2 ).


Applications

这里写图片描述


Modelling the Connection

-Reflexive
-Symmetric
-Transitive

Connected Component

Maximal set of objects that have mutually connected.

Find Query

Check if 2 objects are in the same connected component.

Union Command

Replace components containing 2 objects with their union.


Data Type API

这里写图片描述

Test Code

这里写图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值