scalax.collection.mutable.GraphLike
Returns a random element of the set if it is nonEmpty otherwise throws
IllegalArgumentException.
Returns a random element of the set if it is nonEmpty otherwise throws
IllegalArgumentException.
a random generator; it is essential that random be instantiated
by the caller just once for any sequence of calls
Finds the inner node corresponding to outerNode.
Finds the inner node corresponding to outerNode.
the inner node wrapped by Some if found, otherwise None.
Finds an entry in the collection based on toMatch's hashCode and a correspondence
function but not on the argument type.
Finds an entry in the collection based on toMatch's hashCode and a correspondence
function but not on the argument type.
a value not necessarily of type A; the entry to be searched for
must have the same hashCode and be equal to this argument
function returning whether a given entry corresponds to other
the entry corresponding to toMatch or null if not contained
Finds the inner node corresponding to outerNode.
Finds the inner node corresponding to outerNode.
the inner node if found, otherwise NoSuchElementException is thrown.
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.
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.
Finds the inner node corresponding to outerNode.
Finds the inner node corresponding to outerNode.
the inner node if found, otherwise null.
removes node from this node set leaving the edge set unchanged.
removes node from this node set leaving the edge set unchanged.
the node to be removed from the node set.
removes all incident edges of node from the edge set leaving the node set unchanged.
removes all incident edges of node from the edge set leaving the node set unchanged.
the node the incident edges of which are to be removed from the edge set.
(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.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
(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.
Converts this node set to a set of outer nodes.
Converts this node set to a set of outer nodes.
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.
(nodeSet: any2stringadd[This.NodeSet]).+(other)
(nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).andThen(g)
(nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).apply(v1)
(nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).compose(g)
(nodeSet: MonadOps[This.NodeT]).filter(p)
(nodeSet: MonadOps[This.NodeT]).flatMap(f)
(nodeSet: FlattenOps[N]).flatten
(nodeSet: MonadOps[This.NodeT]).map(f)
(nodeSet: OuterNode[This.NodeSet]).stringPrefix
(nodeSet: OuterNode[This.NodeSet]).toString()
(nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).toString()
(nodeSet: MonadOps[This.NodeT]).withFilter(p)