VertexConnectivity

Tersedia

Minimum vertex cut size (s-t form uses vertex-disjoint paths)

Bentuk

VertexConnectivity[g]

VertexConnectivity[g, s, t]

VertexConnectivity[{v -> w, …}, …]

Contoh disahkanVertexConnectivity[CompleteGraph[4]] → 3

Jalankan ini di Qurak Cari dalam rujukan

Topik

Graph Components - Vertex Connectivity
Graph Measures - Connectivity Measures
Graph Properties And Measurements - Connectivity Measures
New In90 Alphabetical Listing - V
New In90 Mathematics And Algorithms - Graphs & Networks »
Summary Of New Features In140 - Graphs

Berkaitan

EdgeConnectivity ConnectedComponents HararyGraph WeaklyConnectedComponents AdjacencyList ConnectedGraphComponents EdgeAdd EdgeCount EdgeDelete EdgeIndex EdgeList EmptyGraphQ

Semua 6300 fungsi · Gunakan ini daripada klien MCP