Complete graphs#
Undirected complete graph#
- complete_graph[vert_type](size: int) undirected_network[vert_type] #
-
template<integer_network_vertex VertT>
undirected_network<VertT> complete_graph(VertT size)#
Generates a network of size size
vertices where all possible edges are
present.
Complete directed graph#
- complete_directed_graph[vert_type](size: int) directed_network[vert_type] #
-
template<integer_network_vertex VertT>
directed_network<VertT> complete_directed_graph(VertT size)#
Generates a directed network of size size
vertices where all possible
edges are present.