A directed graph is strongly connected if any two nodes are connected via paths in both directions.
Details
See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#gacd21b34d7b42b9835a204a57fcf15964 for more information.
A directed graph is strongly connected if any two nodes are connected via paths in both directions.
See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#gacd21b34d7b42b9835a204a57fcf15964 for more information.