Function is_block_graph 

pub fn is_block_graph(graph: &Graph) -> IgraphResult<bool>

Check whether a graph is a block graph.

A block graph is a connected graph where every biconnected component is a complete graph (clique).

An empty graph (0 vertices) is a block graph (vacuously). A single vertex is a block graph. A disconnected graph is NOT a block graph.

Returns false for directed graphs (block graph is an undirected graph concept).

Examples

use rust_igraph::{Graph, is_block_graph};

// Two triangles sharing a vertex: each block is K3
let mut g = Graph::with_vertices(5);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(3, 4).unwrap();
g.add_edge(4, 2).unwrap();
assert!(is_block_graph(&g).unwrap());

// C4 is NOT a block graph (biconnected but not complete)
let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(3, 0).unwrap();
assert!(!is_block_graph(&g).unwrap());