Analysis of connectivity concept of graphs

Analysis of connectivity concept of graphs

@ (data structure)

For non-directed graphs:

Connectivity: Paths exist from vertex v to vertex W. Maximal connectivity Sub-graph: This connected sub-graph contains all of the edges of the minimum connectivity sub-graph: To keep the diagram unobstructed, but also to make the least number of sides .

The spanning tree of graphs is a very small connected sub-graph.

That is: for the tree, cut off an edge, it will become a non-connected graph, if the addition of an edge will form a loop.

For directed graphs:

Strong connectivity: Consider the direction, from Vertex v to vertex W, from Vertex W to Vertex v has a path, called strong connectivity .

Weak connectivity: Regardless of direction, that is, the directed graph is degraded to undirected graphs to consider connectivity.

If any pair of vertices in the graph are strongly connected, it is called a strongly connected graph.

Generally find strong connected graph, first find the ring , the point on the ring must have a path, and then expand on this basis to find.