Function degeneracy 

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

Return the degeneracy of a graph.

The degeneracy is the smallest k such that the graph is k-degenerate, i.e., the maximum coreness value.

Directed graphs are treated as undirected.

Examples

use rust_igraph::{Graph, degeneracy};

let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(1, 3).unwrap();
assert_eq!(degeneracy(&g).unwrap(), 1);