Function rs_graph::classes::complete_bipartite

pub fn complete_bipartite<'a, G>(n: usize, m: usize) -> G where
    G: Graph<'a> + Buildable, 

Returns a complete bipartite graph on n+m nodes.

The edges will run between the first n nodes and the last m nodes. If G is a digraph, the edges will run in this direction.