Oleksii Trekhleb | Javascript algorithms (Strongly connected component)
This is a series of books diving deep into the core mechanisms of the JavaScript language.
· 1 phút đọc.
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
Share:
