# Functions
NewDirectedMultigraph creates a new directed multigraph.
NewDirectedMultigraphWithFeatures creates a new directed multigraph with the specified graph features.
NewDirectedPseudograph creates a new directed pseudograph.
NewDirectedPseudographWithFeatures a new directed pseudograph with the given graph features.
NewDirectedWeightedMultigraph creates a new directed weighted multigraph.
NewDirectedWeightedMultigraphWithFeatures creates a new directed weighted multigraph with the specified graph features.
NewDirectedWeightedPseudograph creates a new directed weighted pseudograph.
NewDirectedWeightedPseudographWithFeatures creates a new directed weighted pseudograph with the given graph features.
NewEdge creates a globally unique edge that can be added to any graph.
NewMutableEdgeSet creates a new mutable edge set using the given underlying set to store the edges.
NewSimpleDirectedGraph creates a new simple directed graph.
NewSimpleDirectedGraphWithFeatures creates a new simple directed graph with the specified graph features.
NewSimpleDirectedWeightedGraph creates a new simple directed weighted graph.
NewSimpleDirectedWeightedGraphWithFeatures creates a new simple directed weighted graph with the specified graph features.
NewSimpleGraph creates a new simple graph.
NewSimpleGraphWithFeatures creates a new simple graph with the specified graph features.
NewSimpleWeightedGraph creates a new simple weighted graph.
NewSimpleWeightedGraphWithFeatures creates a new simple weighted graph with the specified graph features.
NewUndirectedMultigraph creates a new undirected multigraph.
NewUndirectedMultigraphWithFeatures creates a new undirected multigraph with the specified graph features.
NewUndirectedPseudograph creates a new undirected pseudograph.
NewUndirectedPseudographWithFeatures creates a new undirected pseudograph with the specified graph features.
NewUndirectedWeightedMultigraph creates a new undirected weighted multigraph.
NewUndirectedWeightedMultigraphWithFeatures creates a new undirected weighted multigraph with the specified graph features.
NewUndirectedWeightedPseudograph creates a new undirected weighted pseudograph.
NewUndirectedWeightedPseudographWithFeatures creates a new undirected weighted pseudograph with the specified graph features.
OppositeVertexOf finds, for any graph, the vertex connected by the given edge that is not the given vertex.
# Constants
DefaultEdgeWeight is the weight of an edge connected without explicitly specifying a weight in a weighted graph.
DeterministicIteration is a graph feature that causes the insertion order of vertices and edges for a graph to be retained.
DirectedGraphSupportedFeatures are the features supported by all directed graphs.
UndirectedGraphSupportedFeatures are the features supported by all undirected graphs.
# Variables
ErrEdgeAlreadyInGraph indicates that an edge could not be added to a graph because an edge already exists in the graph.
ErrEdgeNotFound indicates that an operation involving an edge could not be completed because that edge does not exist in the graph.
ErrWouldCreateLoop indicates that the addition of an edge would create a loop in the graph, and the graph does not support loops.
# Structs
A DirectedMultigraph is a directed graph that does not permit loops, but does permit multiple edges between any two vertices.
A DirectedPseudograph is a directed graph that permits both loops and multiple edges between vertices.
A DirectedWeightedMultigraph is a directed multigraph for which edges are assigned weights.
A DirectedWeightedPseudograph is a directed pseudograph for which the edges are assigned weights.
NotConnectedError indicates that an operation involving two vertices could not be completed because no edges connect those vertices.
A SimpleDirectedGraph is a directed graph that does not permit loops or multiple edges between vertices.
A SimpleDirectedWeightedGraph is a simple directed graph for which edges are assigned weights.
A SimpleGraph is an undirected graph that does not permit loops or multiple edges between vertices.
A SimpleWeightedGraph is a simple graph for which edges are assigned weights.
An UndirectedMultigraph is an undirected graph that does not permit loops, but does permit multiple edges between any two vertices.
An UndirectedPseudograph is an undirected graph that permits both loops and multiple edges between vertices.
An UndirectedWeightedMultigraph is an undirected multigraph for which edges are assigned weights.
An UndirectedWeightedPseudograph is an undirected pseudograph for which edges are assigned weights.
VertexNotFoundError indicates that an operation involving a given vertex could not be completed because that vertex does not exist in the graph.
# Interfaces
A DirectedGraph is a graph for which the direction of an edge's assocation to its vertices is important.
An Edge is the type of a connection between vertices.
An EdgeSet is a read-only collection of edges.
A Graph is a structure that contains a collection of vertices, some of which may be related to each other by edges.
Mutable is a graph mixin that allows graphs to be modified.
A MutableDirectedGraph is a directed graph that supports modification.
A MutableDirectedWeightedGraph is a directed weighted graph that supports modification.
A MutableEdgeSet is an extension of EdgeSet that additionally supports adding and removing edges.
A MutableUndirectedGraph is an undirected graph that supports modification.
A MutableUndirectedWeightedGraph is an undirected weighted graph that supports modification.
A MutableVertexSet is an extension of VertexSet that additionally supports adding and removing vertices.
An UndirectedGraph is a graph for which the direction of an edge's assocation to its vertices is not important.
A Vertex is the type of a node used in a graph.
A VertexSet is a read-only collection of vertices.
Weighted is a graph mixin that allows edges to be assigned arbitrary numerical weights.
# Type aliases
EdgeSetIterationFunc is a callback function used by the ForEach method of an edge set.
A GraphFeature is a mathematically transparent option for a graph.
VertexSetIterationFunc is a callback function used by the ForEach method of a vertex set.