Function is_semicomplete 

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

Check whether a directed graph is semicomplete.

A semicomplete digraph has at least one arc between every pair of distinct vertices. This generalizes tournaments (which forbid bidirectional edges).

Returns false for undirected graphs.

Examples

use rust_igraph::{Graph, is_semicomplete};

// Tournament on 3 vertices: 0→1, 1→2, 0→2
let mut g = Graph::new(3, true).unwrap();
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(0, 2).unwrap();
assert!(is_semicomplete(&g).unwrap());

// Missing arc between 0 and 2
let mut g = Graph::new(3, true).unwrap();
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
assert!(!is_semicomplete(&g).unwrap());