ConnectedGraphQ

可用

Test whether a graph is connected (strongly connected for directed graphs)

形式

ConnectedGraphQ[g]

已驗證的範例{ConnectedGraphQ[g], Total[VertexDegree[g]] ≥ (VertexCount[g] - 1) / 2} → {False, Total[VertexDegree[g]] >= (-1 + VertexCount[g])/2}

在 Qurak 上執行搜尋參考文件

主題

Graph Components - Connected Components
Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - C
New In80 Mathematics And Algorithms - New Predicates and Properties »

相關

ConnectedComponents ConnectedGraphComponents WeaklyConnectedGraphQ WeaklyConnectedComponents WeaklyConnectedGraphComponents Graph TreeGraph PathGraph TreeGraphQ PathGraphQ EulerianGraphQ AcyclicGraphQ

全部 6300 個函式 · 從 MCP 用戶端使用這個