dgraph.metric

Members

Functions

betweenness
auto ref betweenness(ref Graph g, bool[] ignore = null)

Calculate betweenness centrality of vertices in a graph, using the algorithm developed by Ulrik Brandes (2001) J. Math. Sociol. 25(2): 163-177.

largestClusterSize
size_t largestClusterSize(ref Graph g, bool[] ignore = null)

Calculate the size of the largest connected cluster in the graph.

Structs

VertexQueue
struct VertexQueue

Simple queue implementation for internal use. This will probably be removed once Phobos has an effective queue container.

Meta