GraphDensity

利用可能

Edge count relative to the complete graph (2m/n(n-1))

形式

GraphDensity[g]

GraphDensity[{v -> w, …}]

検証済みの例GraphDensity /@ graphs → graphs GraphDensity[#, SelfLoops -> True]& /@ graphs → graphs

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

関連

GraphLinkEfficiency VertexCount EdgeCount GlobalClusteringCoefficient GraphAssortativity BetweennessCentrality BipartiteGraphQ ButterflyGraph ChromaticPolynomial EulerianGraphQ GraphDistanceMatrix LocalClusteringCoefficient

全 6300 関数 · MCPクライアントから使う