Simple page rank

Very simple implementation of the PageRank algorithm.

Features

• Small footprint
• Zero dependency
• Easy to use API
• Fast `

Usage

let mut pr = Pagerank::<&str>::new();
pr.add_edge("source", "target");
pr.add_edge("source", "another target");
pr.calculate();

// print result (always sorted)

pr.nodes()
	.iter()
	.map(|(node, score)| println!("page {} with score {}", node, score))
	.for_each(drop);

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

lib.rs:

Simple Pagerank

Pretty simple generic implementation of the PageRank graph sorting algorithm.