Function largest_independent_vertex_sets 

pub fn largest_independent_vertex_sets(
    graph: &Graph,
) -> IgraphResult<Vec<Vec<VertexId>>>

Returns only the largest independent vertex sets in the graph.

A largest independent set is a maximal independent set whose size equals the independence number.

Edge directions are ignored for directed graphs.

Examples

use rust_igraph::{Graph, largest_independent_vertex_sets};

// Path 0-1-2-3: largest independent sets are {0,2}, {0,3}, {1,3}
let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();

let sets = largest_independent_vertex_sets(&g).unwrap();
assert_eq!(sets.len(), 3);
for s in &sets {
    assert_eq!(s.len(), 2);
}