Function minimum_dominating_set 

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

Compute an approximate minimum dominating set using a greedy heuristic.

Repeatedly picks the vertex that dominates the most currently-undominated vertices (a vertex dominates itself and all its neighbors). This greedy approach yields an O(ln n)-approximation to the optimal minimum dominating set.

For directed graphs, adjacency considers edges in both directions.

Examples

use rust_igraph::{Graph, minimum_dominating_set, is_dominating_set};

// Path 0-1-2-3-4: {1, 3} dominates all
let mut g = Graph::with_vertices(5);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(3, 4).unwrap();
let ds = minimum_dominating_set(&g).unwrap();
assert!(is_dominating_set(&g, &ds));
assert!(ds.len() <= 4); // greedy should do much better

// Isolated vertices: every vertex must be in the set
let g = Graph::with_vertices(3);
let ds = minimum_dominating_set(&g).unwrap();
assert_eq!(ds.len(), 3);