WeaklyConnectedGraphQ

Available

Tests whether a directed graph is weakly connected — that is, whether its

Forms

WeaklyConnectedGraphQ[g]

Verified examplesWeaklyConnectedGraphQ[Graph[{1 -> 2, 2 -> 3}]] → True WeaklyConnectedGraphQ[Graph[{1 -> 2, 3 -> 4}]] → False

Run this on Qurak Search the reference

Topics

Related

WeaklyConnectedComponents WeaklyConnectedGraphComponents ConnectedGraphQ ConnectedComponents ConnectedGraphComponents AdjacencyList EdgeAdd EdgeConnectivity EdgeCount EdgeDelete EdgeIndex EdgeList

All 6300 functions · Use this from an MCP client