Packages

  • package root
    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection
    Definition Classes
    scalax
  • package constrained

    Traits enabling to implement constraints and use constrained graphs.

    Traits enabling to implement constraints and use constrained graphs.

    Graphs may be constrained dynamically or statically.

    Dynamically constrained means that a constraint is bound to a constrained Graph instance at initialization time. The constrained Graph will then delegate all calls to the methods of ConstraintMethods and ConstraintHandlerMethods to the corresponding methods of the constraint bound to it. The immutable and mutable factories Graph in this package yield dynamically constrained graphs.

    To make use of dynamically constrained graphs you may make use of the predefined constraints or provide an own implementation of Constraint along with its companion object. To initialize a graph with one or several combined constraints just call the graph factory methods of the constraint package passing.

    Statically constrained means that the graph class directly implements the methods declared in ConstraintMethods.

    Definition Classes
    collection
  • package immutable
    Definition Classes
    constrained
  • AdjacencyListGraph
  • DefaultGraphImpl
  • Graph
  • UserConstrainedGraphImpl

trait AdjacencyListGraph[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: AdjacencyListGraph[X, Y[X], This] with Graph[X, Y[X]]] extends immutable.AdjacencyListGraph[N, E, This] with GraphLike[N, E, This]

Self Type
This[N, E]
Linear Supertypes
GraphLike[N, E, This], Constrained[N, E, This[N, E]], ConstraintMethods[N, E, This[N, E]], GraphOps[N, E, This], immutable.AdjacencyListGraph[N, E, This], AdjacencyListBase[N, E, This], collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, GraphAsSet[N, E, This], Set[Param[N, E]], Equals, SetOps[Param[N, E], [_]Set[_], This[N, E]], (Param[N, E]) => Boolean, Iterable[Param[N, E]], IterableFactoryDefaults[Param[N, E], [x]Set[x]], IterableOps[Param[N, E], [_]Set[_], This[N, E]], IterableOnceOps[Param[N, E], [_]Set[_], This[N, E]], scala.collection.IterableOnce[Param[N, E]], AnyRef, Any
Known Subclasses
DefaultGraphImpl, UserConstrainedGraphImpl
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AdjacencyListGraph
  2. GraphLike
  3. Constrained
  4. ConstraintMethods
  5. GraphOps
  6. AdjacencyListGraph
  7. AdjacencyListBase
  8. GraphLike
  9. GraphDegree
  10. GraphTraversal
  11. GraphBase
  12. Serializable
  13. GraphAsSet
  14. Set
  15. Equals
  16. SetOps
  17. Function1
  18. Iterable
  19. IterableFactoryDefaults
  20. IterableOps
  21. IterableOnceOps
  22. IterableOnce
  23. AnyRef
  24. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by predicateToNodePredicate
  4. by TraversableEnrichments
  5. by anyToNode
  6. by ChainingOps
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]
    Definition Classes
    GraphTraversal
  2. abstract class Component extends Properties
    Definition Classes
    GraphTraversal
  3. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Iterable[Component]
    Definition Classes
    GraphTraversal
  4. abstract type Config <: GraphConfig with GenConstrainedConfig with AdjacencyListArrayConfig
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike → AdjacencyListBase → GraphLike
  5. trait Cycle extends Path
    Definition Classes
    GraphTraversal
  6. type CycleNodeOrTopologicalOrder = Either[This.NodeT, This.TopologicalOrder[This.NodeT]]
    Definition Classes
    GraphTraversal
  7. trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
    Definition Classes
    GraphDegree
  8. type DegreeNodeSeqEntry = (Int, This.NodeT)
    Definition Classes
    GraphDegree
  9. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
    Definition Classes
    GraphDegree
  10. trait Edge extends Serializable
    Definition Classes
    GraphBase
  11. class EdgeBase extends InnerEdgeParam[N, E, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  12. type EdgeFilter = (This.EdgeT) => Boolean
    Definition Classes
    GraphBase
  13. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  14. class EdgeSet extends immutable.AdjacencyListGraph.This.EdgeSet with InclExcl[immutable.AdjacencyListGraph.This.EdgeT, Set[immutable.AdjacencyListGraph.This.EdgeT]]
    Definition Classes
    AdjacencyListGraph
  15. type EdgeSetT = This.EdgeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
  16. type EdgeT = This.EdgeBase
    Definition Classes
    AdjacencyListGraph → GraphLike → GraphBase
  17. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  18. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) => U
    Definition Classes
    GraphTraversal
  19. trait Filter[T] extends (T) => Boolean
    Definition Classes
    GraphDegree
  20. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  22. abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]
    Definition Classes
    GraphTraversal
  23. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  24. abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  26. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  27. abstract class InnerNodeImpl extends immutable.AdjacencyListGraph.This.NodeBase with immutable.AdjacencyListGraph.This.InnerNode
    Definition Classes
    AdjacencyListGraph
  28. abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]
    Definition Classes
    GraphTraversal
  29. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  30. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  31. type Layers = Iterable[This.Layer]
    Definition Classes
    GraphTraversal
  32. trait Node extends Serializable
    Definition Classes
    GraphBase
  33. abstract class NodeBase extends (collection.GraphLike.this)#NodeBase with InnerNodeParam[N] with (collection.GraphLike.this)#InnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  34. type NodeFilter = (This.NodeT) => Boolean
    Definition Classes
    GraphBase
  35. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  36. class NodeSet extends immutable.AdjacencyListGraph.This.NodeSet
    Definition Classes
    AdjacencyListGraph
  37. type NodeSetT = This.NodeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
  38. abstract type NodeT <: This.InnerNodeImpl
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphTraversal → GraphBase
  39. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
    Definition Classes
    GraphTraversal
  40. trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
    Definition Classes
    GraphTraversal
  41. abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  42. abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
    Definition Classes
    GraphTraversal
  43. trait Path extends Walk
    Definition Classes
    GraphTraversal
  44. trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]
    Definition Classes
    GraphTraversal
  45. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  46. abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Iterable[Component]
    Definition Classes
    GraphTraversal
  47. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  48. type ThisGraph = AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  49. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  50. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[A]
    Definition Classes
    GraphTraversal
  51. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  52. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  53. trait Walk extends Iterable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  54. trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk] with Growable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  55. class Weight extends AnyRef
    Definition Classes
    GraphTraversal

Abstract Value Members

  1. abstract def componentTraverser(parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.ComponentTraverser
    Definition Classes
    GraphTraversal
  2. implicit abstract def config: generic.GraphConstrainedCompanion.Config with This.Config
    Definition Classes
    GraphLike
  3. abstract val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    GraphLike
  4. abstract def copy(nodes: Iterable[N], edges: Iterable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph
  5. abstract def copy_?(nodes: Iterable[N], edges: Iterable[E[N]]): Either[ConstraintViolation, This[N, E]]
  6. implicit abstract val edgeT: ClassTag[E[N]]
    Definition Classes
    GraphLike
  7. abstract def edges: This.EdgeSetT
    Definition Classes
    AdjacencyListGraph → GraphBase
  8. abstract val graphCompanion: GraphConstrainedCompanion[[X, Y[+X]]This[X, Y]]
    Definition Classes
    GraphLike → GraphAsSet
  9. abstract def innerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerEdgeTraverser
    Definition Classes
    GraphTraversal
  10. abstract def innerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerElemTraverser
    Definition Classes
    GraphTraversal
  11. abstract def innerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversal
  12. abstract def innerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerNodeTraverser
    Definition Classes
    GraphTraversal
  13. abstract def newNodeSet: This.NodeSetT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  14. abstract def newNodeWithHints(node: N, hints: Hints): This.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  15. abstract def newPathBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) => Option[This.EdgeT]): This.PathBuilder
    Definition Classes
    GraphTraversal
  16. abstract def newWalkBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) => Option[This.EdgeT]): This.WalkBuilder
    Definition Classes
    GraphTraversal
  17. abstract def nodes: This.NodeSetT
    Definition Classes
    AdjacencyListGraph → GraphBase
  18. abstract def outerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterEdgeTraverser
    Definition Classes
    GraphTraversal
  19. abstract def outerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterElemTraverser
    Definition Classes
    GraphTraversal
  20. abstract def outerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversal
  21. abstract def outerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterNodeTraverser
    Definition Classes
    GraphTraversal
  22. abstract def preAdd(edge: E[N]): PreCheckResult

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added.

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    edge

    to be added.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  23. abstract def preAdd(node: N): PreCheckResult

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added.

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    node

    to be added

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  24. abstract def preSubtract(edge: This.EdgeT, simple: Boolean): PreCheckResult

    This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted.

    This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    edge

    the inner edge to be subtracted.

    simple

    true for standard (edge-only by -), false for ripple (by -!) removal.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  25. abstract def preSubtract(node: This.NodeT, forced: Boolean): PreCheckResult

    This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted.

    This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    node

    the inner to be subtracted.

    forced

    true for standard (ripple by -), false for gentle (by -?) removal.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  26. abstract val self: This[N, E]

    When extending Constraint, self will denote the attached constrained graph.

    When extending Constraint, self will denote the attached constrained graph. The factory methods of the companion object scalax.collection.constrained.Graph initialize self to the correct graph instance. When extending Constrained, self will denote this graph.

    Definition Classes
    ConstraintMethods
  27. abstract def strongComponentTraverser(parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.StrongComponentTraverser
    Definition Classes
    GraphTraversal

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def +(node: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  6. final def +(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphOps
  7. final def +#(e: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  8. final def +#?(e: E[N]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  9. final def ++(that: scala.collection.IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  10. final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  11. def ++?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, This[N, E]]

    Same as ++ but $Info.

    Same as ++ but $Info.

    Definition Classes
    GraphLike → GraphOps
  12. final def +?(node: N): Either[ConstraintViolation, This[N, E]]

    Same as + but $Info.

    Same as + but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  13. def +?(elem: Param[N, E]): Either[ConstraintViolation, This[N, E]]

    Same as + but $Info.

    Same as + but $Info.

    Definition Classes
    GraphLike → GraphOps
  14. final def -(node: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  15. final def -(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphOps
  16. final def -!#(e: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  17. final def -!#?(e: E[N]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
  18. final def -#(e: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  19. final def -#?(e: E[N]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
  20. final def --(elems: scala.IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphOps
  21. def --?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, This[N, E]]

    Same as -- but $Info.

    Same as -- but $Info.

    Definition Classes
    GraphLike → GraphOps
  22. def ->[B](y: B): (AdjacencyListGraph[N, E, This], B)
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toArrowAssoc[AdjacencyListGraph[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  23. final def -?(n: N): Either[ConstraintViolation, This[N, E]]

    Same as - but $Info.

    Same as - but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  24. def -?(elem: Param[N, E]): Either[ConstraintViolation, This[N, E]]

    Same as - but $Info.

    Same as - but $Info.

    Definition Classes
    GraphLike → GraphOps
  25. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  27. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  28. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  29. def allNodes(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]

    Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  30. def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. final val anyEdge: This.EdgeFilter
    Definition Classes
    GraphBase
  32. final def anyEdgeSelector(from: This.NodeT, to: This.NodeT): Option[This.EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  33. final val anyNode: This.NodeFilter
    Definition Classes
    GraphBase
  34. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  35. final def apply(elem: Param[N, E]): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  36. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  37. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  38. final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphAsSet
  39. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  40. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  41. def checkedMinusEdge(edge: E[N], simple: Boolean, copy: (E[N], This.EdgeT) => This[N, E]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  42. def checkedMinusNode(node: N, forced: Boolean, copy: (N, This.NodeT) => This[N, E]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  43. def checkedPlus(contained: => Boolean, preAdd: => PreCheckResult, copy: => This[N, E], nodes: => Iterable[N], edges: => Iterable[E[N]]): Either[ConstraintViolation, This[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  44. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  45. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  46. final def coll: AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  47. def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  48. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    IterableOnceOps
  49. def compose[A](g: (A) => Param[N, E]): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  50. final def concat(elems: scala.IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphOps
  51. def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
  52. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetOps
  53. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  54. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  55. def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  56. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  57. def count(p: (Param[N, E]) => Boolean): Int
    Definition Classes
    IterableOnceOps
  58. final lazy val defaultEdgeOrdering: This.EdgeOrdering
    Definition Classes
    GraphBase
  59. final lazy val defaultNodeOrdering: This.NodeOrdering
    Definition Classes
    GraphBase
  60. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  61. def degreeCount(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  62. def degreeNodeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): Seq[This.DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  63. def degreeNodesMap(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, AnySet[This.NodeT]]
    Definition Classes
    GraphDegree
  64. def degreeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  65. def degreeSet(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  66. def diff(that: AnySet[Param[N, E]]): This[N, E]
    Definition Classes
    GraphAsSet → SetOps
  67. def drop(n: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  68. def dropRight(n: Int): This[N, E]
    Definition Classes
    IterableOps
  69. def dropWhile(p: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  70. def edgeIterator: Iterator[This.EdgeT]
    Definition Classes
    AdjacencyListBase
  71. implicit final def edgeToEdgeCont(e: E[N]): E[This.NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  72. def empty: This[N, E]
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  73. def ensuring(cond: (AdjacencyListGraph[N, E, This]) => Boolean, msg: => Any): AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEnsuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  74. def ensuring(cond: (AdjacencyListGraph[N, E, This]) => Boolean): AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEnsuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  75. def ensuring(cond: Boolean, msg: => Any): AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEnsuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  76. def ensuring(cond: Boolean): AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEnsuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  77. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  78. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → Set → Equals → AnyRef → Any
  79. def excl(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike
  80. def exists(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  81. def filter(pred: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  82. def filterNot(pred: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  83. final def find(outerEdge: E[N]): Option[This.EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  84. final def find(outerNode: N): Option[This.NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  85. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  86. final def findCycle[U](implicit visitor: (This.InnerElem) => U): Option[This.Cycle]
    Definition Classes
    GraphTraversal
  87. final def findCycleContaining[U](node: This.NodeT)(implicit visitor: (This.InnerElem) => U): Option[This.Cycle]
    Definition Classes
    GraphTraversal
  88. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  89. def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  90. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  91. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  92. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  93. def forall(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  94. def foreach[U](f: (Param[N, E]) => U): Unit
    Definition Classes
    IterableOnceOps
  95. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toStringFormat[AdjacencyListGraph[N, E, This]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  96. def fromSpecific(coll: IterableOnce[Param[N, E]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  97. final def get(outerEdge: E[N]): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  98. final def get(outerNode: N): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  99. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  100. final def getOrElse(outerEdge: E[N], default: This.EdgeT): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  101. final def getOrElse(outerNode: N, default: This.NodeT): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  102. def graphSize: Int
    Definition Classes
    GraphBase
  103. def groupBy[K](f: (Param[N, E]) => K): Map[K, This[N, E]]
    Definition Classes
    IterableOps
  104. def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
    Definition Classes
    IterableOps
  105. def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  106. def grouped(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  107. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  108. def having(node: This.NodeFilter, edge: This.EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  109. def head: Param[N, E]
    Definition Classes
    IterableOps
  110. def headOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  111. def incl(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike
  112. def init: This[N, E]
    Definition Classes
    IterableOps
  113. final def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  114. def initializeFrom(in: ObjectInputStream, nodes: This.NodeSetT, edges: This.EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  115. def inits: Iterator[This[N, E]]
    Definition Classes
    IterableOps
  116. def intersect(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
  117. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  118. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  119. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  120. final def isCustomEdgeFilter(f: This.EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  121. final def isCustomNodeFilter(f: This.NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  122. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  123. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  124. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  125. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  126. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  127. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  128. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  129. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  130. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  131. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  132. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  133. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  134. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  135. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  136. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  137. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  138. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  139. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Iterable → IterableOps
  140. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → IterableOnce
  141. def knownSize: Int
    Definition Classes
    IterableOnce
  142. def last: Param[N, E]
    Definition Classes
    IterableOps
  143. def lastOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  144. def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, AdjacencyListGraph.this.type]
    Definition Classes
    Iterable
  145. def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): This[NN, EE]
    Definition Classes
    GraphAsSet
  146. def map[B](f: (Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  147. def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  148. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  149. def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  150. def maxDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  151. def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  152. def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  153. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  154. def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  155. def minDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  156. def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  157. final def minusIsolated(n: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  158. final def minusIsolated_?(n: N): Either[ConstraintViolation, This[N, E]]
  159. def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  160. def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  161. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  162. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  163. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  164. val n1: AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  165. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  166. final def newEdge(innerEdge: E[This.NodeT]): This.EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  167. final def newEdgeTArray(size: Int): Array[This.EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  168. final def newNode(n: N): This.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  169. def newSpecificBuilder: Builder[Param[N, E], This[N, E]]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  170. final val noNode: This.NodeFilter
    Definition Classes
    GraphBase
  171. def nodesToAdd(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  172. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  173. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  174. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  175. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  176. def order: Int
    Definition Classes
    GraphBase
  177. final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  178. def partition(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
    Definition Classes
    IterableOps
  179. def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  180. def pipe[B](f: (AdjacencyListGraph[N, E, This]) => B): B
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toChainingOps[AdjacencyListGraph[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  181. def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  182. def postAdd(newGraph: This[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, This[N, E]]

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back.

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-addition would-be graph waiting for commit.

    passedNodes

    the normalized nodes passed to the add operation.

    passedEdges

    the normalized edges passed to the add operation.

    preCheck

    the result of preAdd.

    returns

    None to accept newGraph or Some reason for constraint violation resp. rejection

    Definition Classes
    ConstraintMethods
  183. def postSubtract(newGraph: This[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, This[N, E]]

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back.

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-subtraction would-be graph waiting for commit.

    passedNodes

    the normalized nodes passed to the subtraction operation.

    passedEdges

    the normalized edges passed to the subtraction operation.

    preCheck

    the result of preSubtract.

    returns

    None to accept newGraph or Some reason for constraint violation resp. rejection

    Definition Classes
    ConstraintMethods
  184. def preAdd(elems: InParam[N, E]*): PreCheckResult

    This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added.

    This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added. If postAdd has been implemented, this method may always return PostCheck. The default implementation calls preAdd(node)/preAdd(edge) element-wise. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.

    elems

    nodes and/or edges to be added possibly containing duplicates.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  185. def preCreate(nodes: Iterable[N], edges: Iterable[E[N]]): PreCheckResult

    This pre-check is called on constructing a graph through its companion object.

    This pre-check is called on constructing a graph through its companion object. It must return whether the graph is allowed to be populated with nodes and edges. The default implementation calls preAdd for each node and edge.

    Note that nodes and edges coming from node/edge input streams are not checked. So when utilizing streams the post check postAdd must be served.

    nodes

    the outer nodes the graph is to be populated with; nodes being edge ends may but need not be contained in nodes.

    edges

    the outer edges the graph is to be populated with.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  186. def preSubtract(nodes: => Set[This.NodeT], edges: => Set[This.EdgeT], simple: Boolean): PreCheckResult

    This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted.

    This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted. It is typically triggered by the -- operation. The default implementation element-wise calls preSubtract(node, simple) or preSubtract(edge, simple), respectively. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.

    nodes

    the inner nodes to be subtracted not necessarily including the ends of edges to be subtracted. Call allNodes to get the complete set of nodes to be subtracted.

    edges

    the inner edges to be subtracted.

    simple

    true for standard (edge-only by -), false for ripple (by -!) removal.

    returns

    The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  187. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  188. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  189. def reduce[B >: Param[N, E]](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  190. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  191. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
    Definition Classes
    IterableOnceOps
  192. def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  193. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  194. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  195. def reversed: Iterable[Param[N, E]]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  196. def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
    Definition Classes
    IterableOps
  197. def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  198. def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
    Definition Classes
    IterableOps
  199. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  200. def size: Int
    Definition Classes
    IterableOnceOps
  201. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  202. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  203. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  204. def slice(from: Int, until: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  205. def sliding(size: Int, step: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  206. def sliding(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  207. def span(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  208. def splitAt(n: Int): (This[N, E], This[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  209. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
    Definition Classes
    IterableOnce
  210. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → Set → Iterable
  211. def subsetOf(that: Set[Param[N, E]]): Boolean
    Definition Classes
    SetOps
  212. def subsets(): Iterator[This[N, E]]
    Definition Classes
    SetOps
  213. def subsets(len: Int): Iterator[This[N, E]]
    Definition Classes
    SetOps
  214. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  215. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  216. val t: Set[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  217. def tail: This[N, E]
    Definition Classes
    IterableOps
  218. def tails: Iterator[This[N, E]]
    Definition Classes
    IterableOps
  219. def take(n: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  220. def takeRight(n: Int): This[N, E]
    Definition Classes
    IterableOps
  221. def takeWhile(p: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  222. def tap[U](f: (AdjacencyListGraph[N, E, This]) => U): AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toChainingOps[AdjacencyListGraph[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  223. def tapEach[U](f: (Param[N, E]) => U): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  224. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Definition Classes
    IterableOnceOps
  225. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  226. final def toBuffer[B >: Param[N, E]]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  227. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  228. final def toIterable: AdjacencyListGraph.this.type
    Definition Classes
    Iterable → IterableOps
  229. def toList: List[Param[N, E]]
    Definition Classes
    IterableOnceOps
  230. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  231. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  232. def toSeq: Seq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  233. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    IterableOnceOps
  234. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  235. def toString(): String
    Definition Classes
    GraphLike → Set → Function1 → Iterable → AnyRef → Any
  236. def toVector: Vector[Param[N, E]]
    Definition Classes
    IterableOnceOps
  237. final def topologicalSort[U](implicit visitor: (This.InnerElem) => U): This.CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  238. final def topologicalSortByComponent[U](implicit visitor: (This.InnerElem) => U): Iterable[This.CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  239. def totalDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  240. def totalWeight: Double
    Definition Classes
    GraphBase
  241. def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
    Definition Classes
    IterableOps
  242. final def union(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  243. def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  244. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
    Definition Classes
    IterableOps
  245. val value: AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  246. def view: View[Param[N, E]]
    Definition Classes
    IterableOps
  247. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  248. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  249. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  250. def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
    Definition Classes
    IterableOps
  251. final def withoutChecks[R](exec: => R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  252. def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
    Definition Classes
    IterableOps
  253. def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
    Definition Classes
    IterableOps
  254. def zipWithIndex: AnySet[(Param[N, E], Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  255. final def |(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  256. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  257. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toEdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  258. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  259. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  260. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  261. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toany2stringadd[AdjacencyListGraph[N, E, This]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: any2stringadd[AdjacencyListGraph[N, E, This]]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) => A): (Param[Param[N, E], EI]) => A
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) => Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) => Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) => Param[Param[N, E], EI]): (A) => Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) => Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. val self: AdjacencyListGraph[N, E, This]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toChainingOps[AdjacencyListGraph[N, E, This]] performed by method ChainingOps in scalax.collection.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: ChainingOps[AdjacencyListGraph[N, E, This]]).self
    Definition Classes
    ChainingOps
  6. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: OuterNode[AdjacencyListGraph[N, E, This]]).stringPrefix
    Definition Classes
    NodeParam
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) => Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  8. def toString(): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toOuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: OuterNode[AdjacencyListGraph[N, E, This]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def ++:[B >: Param[N, E]](that: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  3. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

  4. def -!(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike
    Annotations
    @deprecated
    Deprecated

    (Since version 1.13) When deleting an edge, to get nodes deleted that become isolated, delete them beforehand.

  5. def --!(elems: IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphLike
    Annotations
    @deprecated
    Deprecated

    (Since version 1.13) When deleting edges, to get nodes deleted that become isolated, delete them beforehand.

  6. def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  7. final def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  8. def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  9. final def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  10. def aggregate[B](z: => B)(seqop: (B, Param[N, E]) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  11. def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  12. def companion: IterableFactory[[_]AnySet[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  13. def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  14. final def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  15. def count(f: (Param[N, E]) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  16. def exists(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  17. def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  18. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

  19. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  20. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  21. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  22. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  23. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  24. def forall(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  25. def foreach[U](f: (Param[N, E]) => U): Unit
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  26. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  27. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  28. def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  29. def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  30. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  31. def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  32. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  33. def mkString: String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  34. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  35. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  36. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  37. def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  38. def reduce(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  39. def reduceLeft(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  40. def reduceLeftOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  41. def reduceOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  42. def reduceRight(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  43. def reduceRightOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  44. final def repr: This[N, E]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  45. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  46. def seq: AdjacencyListGraph.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  47. def size: Int
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  48. def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  49. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  50. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  51. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  52. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  53. final def toIterable: Iterable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  54. def toIterator: Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  55. final def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  56. def toList: List[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  57. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  58. def toSeq: Seq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  59. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  60. def toStream: Stream[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  61. final def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  62. final def toTraversable: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  63. final def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  64. def toVector: Vector[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  65. def view(from: Int, until: Int): View[Param[N, E]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  66. def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  67. def →[B](y: B): (AdjacencyListGraph[N, E, This], B)
    Implicit
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] toArrowAssoc[AdjacencyListGraph[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from GraphLike[N, E, This]

Inherited from Constrained[N, E, This[N, E]]

Inherited from ConstraintMethods[N, E, This[N, E]]

Inherited from GraphOps[N, E, This]

Inherited from immutable.AdjacencyListGraph[N, E, This]

Inherited from AdjacencyListBase[N, E, This]

Inherited from collection.GraphLike[N, E, This]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from GraphAsSet[N, E, This]

Inherited from Set[Param[N, E]]

Inherited from Equals

Inherited from SetOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from (Param[N, E]) => Boolean

Inherited from Iterable[Param[N, E]]

Inherited from IterableFactoryDefaults[Param[N, E], [x]Set[x]]

Inherited from IterableOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from IterableOnceOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from scala.collection.IterableOnce[Param[N, E]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromAdjacencyListGraph[N, E, This] to IterableOnceExtensionMethods[Param[N, E]]

Inherited by implicit conversion EdgeAssoc fromAdjacencyListGraph[N, E, This] to EdgeAssoc[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion predicateToNodePredicate fromAdjacencyListGraph[N, E, This] to (Param[Param[N, E], EI]) => Boolean

Inherited by implicit conversion TraversableEnrichments fromAdjacencyListGraph[N, E, This] to TraversableEnrichments[Param[N, E], Set]

Inherited by implicit conversion anyToNode fromAdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion ChainingOps fromAdjacencyListGraph[N, E, This] to ChainingOps[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion any2stringadd fromAdjacencyListGraph[N, E, This] to any2stringadd[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion StringFormat fromAdjacencyListGraph[N, E, This] to StringFormat[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion Ensuring fromAdjacencyListGraph[N, E, This] to Ensuring[AdjacencyListGraph[N, E, This]]

Inherited by implicit conversion ArrowAssoc fromAdjacencyListGraph[N, E, This] to ArrowAssoc[AdjacencyListGraph[N, E, This]]

Ungrouped