Function walktrap 

pub fn walktrap(graph: &Graph) -> IgraphResult<WalktrapResult>

Run Walktrap on an unweighted, undirected graph with default steps = 4.

Errors

• IgraphError::Unsupported if graph.is_directed().

Examples

use rust_igraph::{Graph, walktrap};

// Triangle: walktrap puts all three vertices in one community.
let mut g = Graph::with_vertices(3);
for &(u, v) in &[(0, 1), (1, 2), (2, 0)] {
    g.add_edge(u, v).unwrap();
}
let r = walktrap(&g).unwrap();
assert_eq!(r.nb_clusters, 1);
assert_eq!(r.membership, vec![0, 0, 0]);