Function rs_graph::classes::complete_bipartite
source · pub fn complete_bipartite<G>(n: usize, m: usize) -> Gwhere
G: Graph + Buildable,
Expand description
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.