出典:Wiktionary
出典:『Wiktionary』 (2013/11/09 07:29 UTC 版)
出典:Wikipedia
出典:『Wikipedia』 (2011/03/30 17:38 UTC 版)
A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a path from b to a.