GraphDiameter

Tersedia

Maximum shortest path distance.

Bentuk

GraphDiameter[g]

GraphDiameter[{v -> w, …}]

Contoh disahkanGraphDiameter[KaryTree[3]] → 2Pilihan

EdgeWeight — default Automatic
Method — default Automatic

Jalankan ini di Qurak Cari dalam rujukan

Topik

Graph Measures - Distance Measures
Graph Paths Cycles And Flows - Longest Shortest Paths
Graph Properties And Measurements - Distance Measures
New In80 Alphabetical Listing - G
New In80 Mathematics And Algorithms - New Graph Computations »
Summary Of New Features In140 - Graphs

Berkaitan

VertexEccentricity GraphRadius GraphPeriphery GraphCenter GraphDistanceMatrix ConnectedComponents FindShortestPath GraphComplement GraphDifference GraphDistance GraphIntersection GraphUnion

Semua 6300 fungsi · Gunakan ini daripada klien MCP