IGraph.Algorithms.Centrality

Documentation

closeness

Arguments

:: [Int]

vertices

-> Graph d v e

-> Maybe [Double]

optional edge weights

-> Bool

whether to normalize the results

-> [Double]

The normalized closeness centrality of a node is the average length of the shortest path between the node and all other nodes in the graph.

betweenness :: [Int] -> Graph d v e -> Maybe [Double] -> [Double]

Betweenness centrality

eigenvectorCentrality :: Graph d v e -> Maybe [Double] -> [Double]

Eigenvector centrality

pagerank

Arguments

:: SingI d

=> Graph d v e

-> Maybe [Double]

Node weights or reset probability. If provided, the personalized PageRank will be used

-> Maybe [Double]

Edge weights

-> Double

damping factor, usually around 0.85

-> [Double]

Google's PageRank algorithm, with option to