Random walks as hashmaps

oscoin / osrank-rs

A pre-alpha osrank implementation in Rust.

http://oscoin.io/

3 stars 3 forks source link

Closed MeBrei closed 5 years ago

MeBrei commented 5 years ago

To increase performance of handling random walks, they should be reimplemented as hashmaps.

The only information about the walks that we need is:

the starting point of the walk, to make sure there are R random walks starting from each node
the number of visits of the walk per node