pub fn cliques(
graph: &Graph,
min_size: u32,
max_size: u32,
max_results: Option<usize>,
) -> IgraphResult<Vec<Vec<VertexId>>>Expand description
Finds all cliques (complete subgraphs) in the graph within a size range.
Returns all cliques of size min_size..=max_size. Unlike
maximal_cliques, this includes non-maximal cliques (subsets of
larger cliques). If max_results is Some(n), at most n cliques
are returned.
Edge directions are ignored for directed graphs.
ยงExamples
use rust_igraph::{Graph, cliques};
// Triangle 0-1-2: contains 3 edges (cliques of size 2) + 1 triangle (size 3)
let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(0, 2).unwrap();
let all = cliques(&g, 2, 3, None).unwrap();
assert_eq!(all.len(), 4); // 3 edges + 1 triangle