Qurak
Увійти

WeaklyConnectedGraphQ

Доступно

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

WeaklyConnectedGraphQ[g]
WeaklyConnectedGraphQ[Graph[{1 -> 2, 2 -> 3}]] → TrueWeaklyConnectedGraphQ[Graph[{1 -> 2, 3 -> 4}]] → False
Виконати на QurakПошук у довіднику

Теми

Пов'язане

WeaklyConnectedComponentsWeaklyConnectedGraphComponentsConnectedGraphQConnectedComponentsConnectedGraphComponentsAdjacencyListEdgeAddEdgeConnectivityEdgeCountEdgeDeleteEdgeIndexEdgeList

Усі 6300 функцій · Використати з MCP-клієнта