Function leiden 

pub fn leiden(graph: &Graph) -> IgraphResult<LeidenResult>

Run Leiden with the default modularity objective, γ = 1, β = 0.01, two iterations, seed 0.

Errors

• IgraphError::Unsupported if graph is directed.

Examples

use rust_igraph::{Graph, leiden};

// Two triangles joined by a single bridge edge.
let mut g = Graph::with_vertices(6);
for &(u, v) in &[(0, 1), (0, 2), (1, 2), (3, 4), (3, 5), (4, 5), (2, 3)] {
    g.add_edge(u, v).unwrap();
}
let r = leiden(&g).unwrap();
assert_eq!(r.membership[0], r.membership[1]);
assert_eq!(r.membership[3], r.membership[4]);
assert_ne!(r.membership[0], r.membership[3]);
assert!(r.quality > 0.30);