Function complete_graph 

pub fn complete_graph<Ty: EdgeType, Ix: IndexType>(
    n: usize,
) -> Graph<(), (), Ty, Ix>

Generates a complete graph with n nodes. A complete graph is a graph where each node is connected to every other node. On a directed graph, this means that each node has n - 1 incoming edges and n - 1 outgoing edges.

Examples

use petgraph_gen::complete_graph;
use petgraph::{Directed, Graph, Undirected};

let directed_graph: Graph<(), (), Directed> = complete_graph(10);
assert_eq!(directed_graph.node_count(), 10);
assert_eq!(directed_graph.edge_count(), 90);

let undirected_graph: Graph<(), (), Undirected> = complete_graph(10);
assert_eq!(undirected_graph.node_count(), 10);
assert_eq!(undirected_graph.edge_count(), 45);