# networkx.algorithms.tournament.is_strongly_connected¶

is_strongly_connected(G)[source]

Decides whether the given tournament is strongly connected.

This function is more theoretically efficient than the is_strongly_connected() function.

The given graph must be a tournament, otherwise this function’s behavior is undefined.

Parameters

G (NetworkX graph) – A directed graph representing a tournament.

Returns

Whether the tournament is strongly connected.

Return type

bool

Notes

Although this function is more theoretically efficient than the generic strong connectivity function, a speedup requires the use of parallelism. Though it may in the future, the current implementation does not use parallelism, thus you may not see much of a speedup.

This algorithm comes from [1].

References

1

Tantau, Till. “A note on the complexity of the reachability problem for tournaments.” Electronic Colloquium on Computational Complexity. 2001. <http://eccc.hpi-web.de/report/2001/092/>