pub fn complement<N, E, Ix>(graph: &Graph<N, E, Ix>) -> Graph<N, (), Ix>where N: Node + Clone, E: EdgeWeight, Ix: IndexType,
Computes the complement of a graph
The complement G̅ of a graph G has the same vertex set as G, but edge (u,v) is in G̅ if and only if (u,v) is not in G.