Function matching_number 

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

Compute the matching number ν(G).

The size of the maximum matching. Also called the edge independence number.

Examples

use rust_igraph::{Graph, matching_number};

// K_4: perfect matching exists, ν = 2
let g = Graph::from_edges(
    &[(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)], false, Some(4)
).unwrap();
assert_eq!(matching_number(&g).unwrap(), 2);