Type of configuration required for a specific Graph
companion.
The default configuration to be used in absence of a user-supplied configuration.
Creates an empty Graph
instance.
Produces a graph with a node set containing all nodes
and edge ends in edges
and with an edge set containing all edges
but duplicates.
Produces a graph with a node set containing all nodes
and edge ends in edges
and with an edge set containing all edges
but duplicates.
Duplicate exclusion takes place on the basis of values
returned by hashCode
of the supplied nodes and edges. The hash-code
value of an edge is determined by its ends and optionally by other
edge components such as weight
or label
. To include non-node edge
components in the hash-code of an edge make use of any of the predefined
key-weighted/key-labeled edges or mix ExtendedKey
into your custom
edge class.
the isolated and optionally any other non-isolated nodes to be included in the node set of the graph to be created.
all edges to be included in the edge set of the graph to be created. Edge ends will be added to the node set automatically.
A new graph instance containing nodes
and all edge ends
and edges
.
Creates a Graph
with a node set built from all nodes in elems
including
edge ends and with an edge set containing all edges in elems
.
Creates a Graph
with a node set built from all nodes in elems
including
edge ends and with an edge set containing all edges in elems
.
Duplicate exclusion takes place on the basis of values
returned by hashCode
of the supplied nodes and edges. The hash-code
value of an edge is determined by its ends and optionally by other
edge components such as weight
or label
. To include non-node edge
components in the hash-code of an edge make use of any of the predefined
key-weighted/key-labeled edges or mix ExtendedKey
into your custom
edge class.
sequence of nodes and/or edges in an arbitrary order
A new graph instance containing the nodes and edges derived from elems
.
Produces a graph containing the results of some element computation a number of times.
Produces a graph containing the results of some element computation a number of times.
Duplicate exclusion takes place on the basis of values
returned by hashCode
of the supplied nodes and edges. The hash-code
value of an edge is determined by its ends and optionally by other
edge components such as weight
or label
. To include non-node edge
components in the hash-code of an edge make use of any of the predefined
key-weighted/key-labeled edges or mix ExtendedKey
into your custom
edge class.
the number of elements to be contained in the graph.
the element computation returning nodes or edges nr
times.
A graph that contains the results of nr
evaluations of elem
.
Methods common to
Graph
companion objects in the core module.the kind of type of the graph that is to become the companion class/trait of the object extending this trait.