Function is_k_degenerate 

pub fn is_k_degenerate(graph: &Graph, k: u32) -> IgraphResult<bool>

Check whether a graph is k-degenerate.

A graph is k-degenerate if every non-empty subgraph has a vertex of degree at most k. Uses the coreness decomposition and checks that the maximum core number does not exceed k.

Directed graphs are treated as undirected.

Examples

use rust_igraph::{Graph, is_k_degenerate};

// Tree is 1-degenerate
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!(is_k_degenerate(&g, 1).unwrap());
assert!(!is_k_degenerate(&g, 0).unwrap());

// `K_4` is 3-degenerate but NOT 2-degenerate
let mut g = Graph::with_vertices(4);
for i in 0..4u32 {
    for j in (i+1)..4 {
        g.add_edge(i, j).unwrap();
    }
}
assert!(is_k_degenerate(&g, 3).unwrap());
assert!(!is_k_degenerate(&g, 2).unwrap());