WeaklyConnectedGraphQ

Tilgjengelig

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

Former

WeaklyConnectedGraphQ[g]

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

Kjør dette på Qurak Søk i referansen

Emner

Relatert

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

Alle 6300 funksjoner · Bruk dette fra en MCP-klient