ConnectedGraphQ

Tersedia

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

Bentuk

ConnectedGraphQ[g]

Contoh disahkan{ConnectedGraphQ[g], Total[VertexDegree[g]] ≥ (VertexCount[g] - 1) / 2} → {False, Total[VertexDegree[g]] >= (-1 + VertexCount[g])/2}

Jalankan ini di Qurak Cari dalam rujukan

Topik

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 »

Berkaitan

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

Semua 6300 fungsi · Gunakan ini daripada klien MCP