49. Toad's data structure note 49 graph connectivity Issues

49. Toad's data structure note 49 graph connectivity Issues

This famous saying:"We have to eat, sleep, swim lazy, love, that is to say, we have to touch the sweetest things in life: but we must not succumb to these things ... -- Jorio ? " Curie "     

This is the last piece of the entry note for the data structure.

Welcome reprint, Reprint please indicate source: http://blog.csdn.net/notbaron/article/details/47135259

Figure g= (V,e) is an undirected graph, and a connected branch of G is the largest connected sub-graph, i.e. a connected branch is not included in any larger connected sub-graph.

1. Connect Diagram

When the undirected graph is traversed, for the connected graph, only one vertex is required for a depth-first search or a breadth-first search to access all the nodes in the graph.

2. Non-connected graphs

When the undirected graph is traversed, the non-connected graph is searched from multiple vertices, and each time a new starting point is taken, the vertex access sequence is exactly the set of vertices in each of its connected components.

3. The connectivity of the undirected graphs

Set the d=<v,e> as a direction graph,

for any u, v? V, if there is a path from u to V, it is called U up to V, recorded as U?v, and specifies that any vertex to itself is always up to.

If any two nodes in D can reach each other, it is said that D is strongly connected.

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

49. Toad's data structure note 49 graph connectivity Issues