pub fn largest_cliques(graph: &Graph) -> IgraphResult<Vec<Vec<VertexId>>>Expand description
Returns only the largest cliques in the graph.
A largest clique is a maximal clique whose size equals the clique number. There may be multiple largest cliques.
Edge directions are ignored for directed graphs.
ยงExamples
use rust_igraph::{Graph, largest_cliques};
let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(0, 2).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
let cliques = largest_cliques(&g).unwrap();
// The triangle {0,1,2} is the only largest clique
assert_eq!(cliques.len(), 1);
assert_eq!(cliques[0].len(), 3);