ppt课件-datastructuresandalgorithms-postechcsedpnm.pptVIP

  • 4
  • 0
  • 约9.01千字
  • 约 54页
  • 2017-01-25 发布于四川
  • 举报

ppt课件-datastructuresandalgorithms-postechcsedpnm.ppt

ppt课件-datastructuresandalgorithms-postechcsedpnm

Path Finding Path between 1 and 8 What is a possible path its length? A path is 1, 2, 5, 9, 8 and its length is 20. Another Path Between 1 and 8 Path length is 28. What is the path? Example of No Path No path between 2 and 9. Connected Graph Let G = (V, E) be an undirected graph G is connected iff there is a path between every pair of vertices in G Example of Not Connected Example of Connected Graph Connected Component A connected component is a maximal subgraph that is connected. A connected graph has exactly 1 component. Connected Components Not a Component Communication Network Each e

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档