Function is_house_free 

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

Check whether a graph is house-free (no induced house graph).

The house is C_5 plus one chord: a triangle {a, b, c} and two extra vertices d, e where c-d, d-e, e-a are edges and a-d, b-d, b-e, c-e are all absent.

Returns false for directed graphs.

Examples

use rust_igraph::{Graph, is_house_free};

// Triangle is house-free
let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
assert!(is_house_free(&g).unwrap());

// House: triangle {0,1,2}, path 2-3-4-0
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, 0).unwrap();
assert!(!is_house_free(&g).unwrap());