it is known that there is a graph consisting of several connected components, and now it is required to mark the edges of all rings in the graph. The example diagram is as follows: (that is, marked with red edges)
kruskal
DFS
I"d like to ask if there is any other better algorithm.
thought for a moment that breadth first might be more appropriate
Baidu [connected component algorithm of undirected graph] is an important part of graph theory algorithm.
the directed graph is directly topologically sorted and then the undeleted edge markers are found.
Previous: Npm run dev Times is wrong.
topic description it is known that there is a graph consisting of several connected components, and now it is required to mark the edges of all rings in the graph. The example diagram is as follows: (that is, marked with red edges) kruskalDFS I...
