scalax.collection.mutable.AdjacencyListGraph
(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) ++
creates a new set. Use ++=
to add elements to this set and return that set itself.
(Changed in version 2.8.0) -
creates a new set. Use -=
to remove an element from this set and return that set itself.
(Changed in version 2.8.0) --
creates a new set. Use --=
to remove elements from this set and return that set itself.
Sorts all nodes according to ord
and concatenates them using separator
.
Sorts all nodes according to ord
and concatenates them using separator
.
to separate nodes by.
custom ordering.
sorted and concatenated string representation of this node set.
This method may be called by an auxiliary constructor.
This method may be called by an auxiliary constructor. If so, it must be defined by the trait responsible for the implementation of the graph representation.
The implementor is not allowed to reset any of the input streams so
he must decide for each input stream whether it is to read by NodeSet.initialize
or by EdgeSet.initialize
, not both. Computing contained inner nodes/edges from
input streams is facilitated by Node.NodeContStream
/Edge.EdgeContStream
respectively.
For parameter descriptions see NodeAux.from
.
This method is called by the primary constructor.
This method is called by the primary constructor. It must be defined by the trait responsible for the implementation of the graph representation.
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
.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
removes node
from this node set leaving the edge set unchanged.
removes all incident edges of node
from the edge set leaving the node set unchanged.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
removes node
either rippling or gently.
removes node
either rippling or gently.
if true
, node
will be deleted with its incident edges;
otherwise node
will be only deleted if it has no incident edges or
all its incident edges are hooks.
implementation of node removal without considering incident edges.
implementation of removal of all incident edges.
true
if node
has been removed.
Sorts all nodes according to ord
, concatenates them using separator
and prefixes and parenthesizes the result with stringPrefix
.
Sorts all nodes according to ord
, concatenates them using separator
and prefixes and parenthesizes the result with stringPrefix
.
to separate nodes by.
custom ordering.
sorted, concatenated and prefixed string representation of this node set.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(Since version 2.10.0) use fold instead