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-клієнта