[igraph] Community detection: deterministic vs non-deterministic

[R N]

Just a quick question: is 'infomap' CD method in igraph-0.6
deterministic or not?
I run infomap algorithm a number of times on the same graph, and the results
are different in many runs, but there are also identical partitions among those
many runs, i.e., it looks like "not enough non-deterministic".

And, to be sure: is the following classification correct?
Deterministic CD methods: fast greedy, edge betweenness, walktrap;
Non-deterministic: label propagation, spinglass, infomap.