Weakly Vs Strongly Connected Graph. Connectedness in Directed Graphs Strongly Connected A directed graph is strongly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph. From page 517 What I cant understand is the second propertydefinition the one that says when you have a directed graph then if the associated undirected graph is connected.
There is a route between every two nodes route path in. Brief demonstration and explanation of Strongly Connected Components this particular graph was copied from another video since i am too lazy to make one up. The weakly connected components are found by a simple breadth-first search.
Usually associated with undirected graphs two way edges.
So strongly connected weakly connected but not the other way. A strongly connected digraph has every vertex reachable from every other vertex when D is applied. If a graph is V E D with D the set of directions V E D is weakly connected if V E is connected so this ensure the basic graph is connected in the first place. Connectedness in Directed Graphs Strongly Connected A directed graph is strongly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph.
