Base trait for graph Orderings.
The empty ElemOrdering.
Ordering for the path dependent type NodeT.
The edge set of this Graph commonly referred to as E(G).
The edge set of this Graph commonly referred to as E(G).
Set of all contained edges.
The node (vertex) set of this Graph commonly referred to as V(G).
The node (vertex) set of this Graph commonly referred to as V(G).
Set of all contained nodes.
Ordering for the path dependent type EdgeT.
Populates this graph with nodes and the edges to be created through edgeStream.
Populates this graph with nodes and the edges to be created through edgeStream.
The implementing class will typically have a constructor with the same parameters
which is invoked through a call to from of the companion object.
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.
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
Method size is reserved for the number of nodes and edges
because Graph is also SetLike with set elements being nodes or edges.
Populates this graph with nodes and edges.
Populates this graph with nodes and edges.
The implementing class will typically have a constructor with the same parameters
which is invoked by from of the companion object.
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.
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.
true if this graph has at most 1 node.
true if this graph has at most 1 node.
true if this graph has at least 2 nodes.
true if this graph has at least 2 nodes.
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
Template for stream-based operations such as instantiation through a stream-based auxiliary constructor.
the user type of the nodes (vertices) in this graph.
the kind of the edges (links) in this graph.