pub fn star<G>(n: usize) -> Gwhere G: Graph + Buildable,
Returns a star graph with n rays.
n
The center node will be the first node. This is equivalent to complete_bipartite(1,n).
complete_bipartite(1,n)
If G is a digraph, the source of all edges will be the center node.