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 nodes and edges read in from the input streams
nodeStreams/edgeStreams and from nodes/edges.
Creates a graph with nodes and edges read in from the input streams
nodeStreams/edgeStreams and from nodes/edges.
Node/edge streams are an efficient way to populate Graph instances from external
resources such as a database. The user has to implement his input stream classes
deriving them from NodeInputStream/EdgeInputStream.
type of nodes.
kind of type of edges.
list of node input streams to be processed. All nodes read from any
of these streams will be added to this graph. Note that only isolated nodes
must be included in a stream or in nodes, non-isolated nodes are optional.
The isolated (and optionally any other) outer nodes that the node set of
this graph is to be populated with. This parameter may be used as an alternative
or in addition to nodeStreams.
list of edge input streams, each with its own edge factory, to be processed. All edges and edge ends (nodes) read from any of these streams will be added to this graph.
The outer edges that the edge set of this graph is to be populated with.
Nodes being the end of any of these edges will be added to the node set.
This parameter is meant be used as an alternative or in addition to edgeStreams.
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.
(graphCompanion: StringAdd).self
(graphCompanion: StringFormat).self
(graphCompanion: ArrowAssoc[GraphCompanion[CC]]).x
(Since version 2.10.0) Use leftOfArrow instead
(graphCompanion: Ensuring[GraphCompanion[CC]]).x
(Since version 2.10.0) Use resultOfEnsuring instead
Methods common to
Graphcompanion 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.