This also adds the epsilon parameter, which drops paths with weight
below this value.

Small fixes of some examples in the docstrings.

Use the original, simpler, path weight calculation.

This fixes how paths are weighted in the absolute_trust algorithm.

This completes all the documentation up to this point.

This dumps the random-path approach, and implements a deterministic,
priority queue algorithm.

Path sampling is done using different bias, and the edge sampling is now
done correctly. There is now only one parameter 'n_iter' which replaces
'min/max_iter' and 'epslon'.

The RNG object must be passed by _reference_ not by value, as is the
default! Otherwise the RNG state does not change...

This modified several docstrings and introduces a quick-start guide.

Now paths are weighted according to their trust value until the last
hop, and paths are not counted twice.

This fully documents the centrality module.

This adds the centrality module, which supports betweenness, eigentrust,
pagerank and absolute trust.