dgraph.metric

Undocumented in source.

Members

betweenness auto ref betweenness(Graph g, bool[] ignore): Calculate betweenness centrality of vertices in a graph, using the algorithm developed by Ulrik Brandes (2001) J. Math. Sociol. 25(2): 163-177.
betweenness auto ref betweenness(Graph g, T[] centrality, bool[] ignore): Undocumented in source. Be warned that the author may not have intended to support it.
largestClusterSize size_t largestClusterSize(Graph g, bool[] ignore): Calculate the size of the largest connected cluster in the graph.

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