Strongly connected graph
Материал из WEGA
Strongly connected graph --- сильно связный граф.
A digraph [math]\displaystyle{ G }[/math] is strongly connected, if for any pair of vertices [math]\displaystyle{ v, w }[/math] there is a path from [math]\displaystyle{ v }[/math] to [math]\displaystyle{ w }[/math] and vice versa.
