Function elimination_ordering 

pub fn elimination_ordering(graph: &Graph) -> IgraphResult<Vec<u32>>

Compute an elimination ordering using the min-degree heuristic.

Returns the ordering as a sequence of vertex ids.

Examples

use rust_igraph::{Graph, elimination_ordering};

let g = Graph::from_edges(&[(0,1),(1,2),(2,3)], false, Some(4)).unwrap();
let order = elimination_ordering(&g).unwrap();
assert_eq!(order.len(), 4);