GraphLinkEfficiency

Доступно

Link efficiency 1 minus mean graph distance over edge count

Формы

GraphLinkEfficiency[g]

GraphLinkEfficiency[{v -> w, …}]

Проверенные примерыg = KnightTourGraph[7, 4]; GraphLinkEfficiency[g] → 4867/5103

Выполнить на Qurak Поиск по справочнику

Темы

Graph Properties And Measurements - Connectivity Measures
New In90 Alphabetical Listing - G
Summary Of New Features In141 - Graphs & Networks
Summary Of New Features In141 - Graphs & Networks

Связанное

GraphDistance MeanGraphDistance GraphDensity GlobalClusteringCoefficient GraphAssortativity BetweennessCentrality BipartiteGraphQ ButterflyGraph ChromaticPolynomial EulerianGraphQ GraphDistanceMatrix LocalClusteringCoefficient

Все 6300 функций · Использовать из MCP-клиента