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 用戶端使用這個