Simple page rank
Very simple implementation of the PageRank algorithm.
Features
- Small footprint
- Easy to use API
- Fast `
Usage
let mut pr = new;
pr.add_edge;
pr.add_edge"source", "another target");
pr.calculate;
// print result (always sorted)
pr.nodes
.iter
.map
.for_each;
Built-in binary example
The repository has a built-in binary example which works with WikiLinkGraphs dataset.
gzcat eswiki.wikilink_graph.2018-03-01.csv.gz| cargo run --release wikilink