GenericGraphFactory
Attributes
- Graph
-
- Supertypes
- Known subtypes
-
trait GenericGraphCoreFactory[CC]trait ImmutableFactory[CC]object DefaultGraphImpl.typeobject Graph.typetrait MutableFactory[CC]object DefaultGraphImpl.typeobject Graph.typeShow all
Members list
Value members
Abstract methods
Creates an empty Graph instance.
Creates an empty Graph instance.
Attributes
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.
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.
Value parameters
- edges
-
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.
- nodes
-
the isolated and optionally any other non-isolated nodes to be included in the node set of the graph to be created.
Attributes
- Returns
-
A new graph instance containing
nodesand all edge ends andedges.
Concrete methods
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.
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.
Value parameters
- elems
-
sequence of nodes and/or edges in an arbitrary order
Attributes
- Returns
-
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. 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.
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.
Value parameters
- elem
-
the element computation returning nodes or edges
nrtimes. - nr
-
the number of elements to be contained in the graph.
Attributes
- Returns
-
A graph that contains the results of
nrevaluations ofelem.