JavaScript Algorithms and Data Structures: Graphs - Strongly Connected Components
Strongly connected components (SCC) in a directed graph are the maximal subsets of vertices such that there is a path from every vertex to every other vertex in the subset. Learn how to find strongly connected components in a graph using JavaScript.
A directed graph is called strongly connected if there is a path in each direction between each pair of vertices of the graph. In a directed graph G that may not itself be strongly connected, a pair of vertices u and v are said to be strongly connected to each other if there is a path in each direction between them.
Graph with strongly connected components marked
References
The Original Article can be found on https://github.com
#javascript #algorithms #datastructures #graphs
2.05 GEEK