I have a problem on undirected graphs that sound like this: "Traverse the width of the graph and list the points where the graph is connected." I found only algorithms that use DFS to find the joints of the joint. Is there any way to find these peaks with BFS? Thank.
Update: how to remove each node and then execute BFS on the remaining chart? if it spans all nodes, then the remote node is not an articulation point. I know this is inefficient, but I think that everything is in order.
source
share