Base trait for graph Ordering
s.
Base trait for graph Ordering
s.
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.
Whether all edges of this graph are directed.
Whether this graph contains at least one hyperedges.
Whether this graph contains at least one multi-edge.
Whether this graph contains at least one multi-edge. We defnie multi-edges by
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.
The empty ElemOrdering.
Default edge filter letting path all edges (non-filter).
Default node filter letting traverse all nodes (non-filter).
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.
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.
true
if f
is not equivalent to anyEdge
.
true
if f
is not equivalent to anyEdge
.
true
if f
is not equivalent to anyNode
.
true
if f
is not equivalent to anyNode
.
true
if this graph has at most 1 node.
true
if this graph has at most 1 node.
Node predicate always returning false
.
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.
Base template trait for graphs.
This trait provides the common structure and base operations for immutable graphs independently of their representation. Base operations also cover one-step traversals. For unlimited traversals see
trait GraphTraversal
.Users of Graph usually don't interact directly with this trait but with
trait Graph
instead which inherits the functionality provided by this trait.If
E
inheritsDirectedEdgeLike
the graph is directed, otherwise it is undirected or mixed.the user type of the nodes (vertices) in this graph.
the kind of the edges (links) in this graph.