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 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 edges according to ord and concatenates them using separator.
Sorts all edges according to ord and concatenates them using separator.
to separate edges by.
custom ordering.
sorted and concatenated string representation of this edge set.
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 edge corresponding to outerEdge.
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.
function returning whether a given entry corresponds to other
the entry corresponding to toMatch or null if not contained
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 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.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
The maximum arity of all edges in this edge set.
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
Converts this edge set to a set of outer edges.
Converts this edge set to a set of outer edges.
Sorts all edges according to ord, concatenates them using separator
and prefixes and parenthesizes the result with stringPrefix.
Sorts all edges according to ord, concatenates them using separator
and prefixes and parenthesizes the result with stringPrefix.
to separate edges by.
custom ordering.
sorted, concatenated and prefixed string representation of this edge set.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
Same as upsert at graph level.
Returns a lazily filtered immutable Set.
Returns a lazily filtered immutable Set.
(edgeSet: StringAdd).+(other)
(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).andThen(g)
(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).apply(v1)
(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).compose(g)
(edgeSet: MonadOps[This.EdgeT]).filter(p)
(edgeSet: MonadOps[This.EdgeT]).flatMap(f)
(edgeSet: FlattenOps[This.NodeT]).flatten
(edgeSet: MonadOps[This.EdgeT]).map(f)
(edgeSet: StringAdd).self
(edgeSet: StringFormat).self
(edgeSet: OuterNode[This.EdgeSet]).stringPrefix
(edgeSet: OuterNode[This.EdgeSet]).toString()
(edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).toString()
(edgeSet: MonadOps[This.EdgeT]).withFilter(p)
(Since version 2.10.0) use fold instead
(Since version 1.8.0) Use toOuter instead
(edgeSet: ArrowAssoc[This.EdgeSet]).x
(Since version 2.10.0) Use leftOfArrow instead
(edgeSet: Ensuring[This.EdgeSet]).x
(Since version 2.10.0) Use resultOfEnsuring instead