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クライアントから使う