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