Strong Connectivity is a thing we use only in directed graphs. Definition of Directed Graphs HERE
Def
Nodes a and b in a graph are mutually reachable if there is both a path from a to b and also a path from b to a. If all the nodes in the graph are mutually reachable in directed graph it is strongly connected .
Lemma. Let s be any node in graph G, Graph G is strongly connected if and only if (iff) s is reachable from every other node and every node is reachable from s.
Read more at https://hecodesit.com/strong-connectivity-in-graphs/
Top comments (1)
First, you need to explain that a graph is a mathematical object that is a set of graph vertices connected by edges. In a directed graph, the edges have a direction and are represented by arrows. To build graph types on an MS EXCEL diagram, you must build graph vertices on a Scatter Chart. Next, we assign a unique signature to each vertex. Then we set the order of connecting the vertices with edges. And at the end, we describe the connections through direct descriptions of the edges and routes. Thus, we assign each edge its own signature in the diagram.