hiperwalk.Complete#
- hiperwalk.Complete(num_vert, multiedges=None, weights=None, copy=False)[source]#
Complete graph constructor.
A complete graph is one in which every vertex is connected to every other vertex. Each pair of distinct vertices is connected by a unique edge unless multiedges are specified.
- Parameters:
- num_vertint
The number of vertices in the complete graph.
- multiedges, weights: matrix or dict, default=None
See Graph Constructors.
- copybool, default=False
See Graph Constructors.
- Returns:
hiperwalk.GraphReturns an instance of a complete graph. See Graph Constructors for more details.
See also
- Graph Constructors
More information on graph constructors and how they are implemented.
Methods#
All methods are inherited from
hiperwalk.Graph,
hiperwalk.Multigraph,
or hiperwalk.WeightedGraph.