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 mutable

    Mutable constrained graph templates.

    Mutable constrained graph templates.

    Definition Classes
    constrained
  • AdjacencyListGraph
  • CompanionAlias
  • DAG
  • DefaultGraphImpl
  • Forest
  • Graph
  • GraphBuilder
  • GraphLike
  • GraphOps
  • Tree
  • UserConstrainedGraphImpl
c

scalax.collection.constrained.mutable

UserConstrainedGraphImpl

class UserConstrainedGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends DefaultGraphImpl[N, E] with UserConstrainedGraph[N, E, DefaultGraphImpl[N, E]]

Annotations
@SerialVersionUID()
Linear Supertypes
UserConstrainedGraph[N, E, DefaultGraphImpl[N, E]], DefaultGraphImpl[N, E], GraphTraversalImpl[N, E], State[N, E], TraverserImpl[N, E], AdjacencyListGraph[N, E, DefaultGraphImpl], mutable.AdjacencyListGraph[N, E, DefaultGraphImpl], AdjacencyListBase[N, E, DefaultGraphImpl], AddSubtract[Param[N, E], DefaultGraphImpl[N, E]], Graph[N, E], GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], GraphOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], constrained.Graph[N, E], constrained.GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], Constrained[N, E, DefaultGraphImpl[N, E]], ConstraintMethods[N, E, DefaultGraphImpl[N, E]], constrained.GraphOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], mutable.Graph[N, E], mutable.GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], EdgeOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]], Cloneable[DefaultGraphImpl[N, E]], Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, collection.Graph[N, E], collection.GraphLike[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, GraphAsSet[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]], Set[Param[N, E]], Equals, SetOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], (Param[N, E]) => Boolean, Iterable[Param[N, E]], IterableFactoryDefaults[Param[N, E], [x]Set[x]], IterableOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], IterableOnceOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], scala.collection.IterableOnce[Param[N, E]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UserConstrainedGraphImpl
  2. UserConstrainedGraph
  3. DefaultGraphImpl
  4. GraphTraversalImpl
  5. State
  6. TraverserImpl
  7. AdjacencyListGraph
  8. AdjacencyListGraph
  9. AdjacencyListBase
  10. AddSubtract
  11. Graph
  12. GraphLike
  13. GraphOps
  14. Graph
  15. GraphLike
  16. Constrained
  17. ConstraintMethods
  18. GraphOps
  19. Graph
  20. GraphLike
  21. EdgeOps
  22. Cloneable
  23. Cloneable
  24. Shrinkable
  25. Growable
  26. Clearable
  27. Graph
  28. GraphLike
  29. GraphDegree
  30. GraphTraversal
  31. GraphBase
  32. Serializable
  33. GraphAsSet
  34. Set
  35. Equals
  36. SetOps
  37. Function1
  38. Iterable
  39. IterableFactoryDefaults
  40. IterableOps
  41. IterableOnceOps
  42. IterableOnce
  43. AnyRef
  44. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by predicateToNodePredicate
  4. by anyToNode
  5. by ChainingOps
  6. by IterableEnrichments
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new UserConstrainedGraphImpl(iniNodes: Iterable[N] = Nil, iniEdges: Iterable[E[N]] = Nil)(implicit edgeT: ClassTag[E[N]], _config: DefaultGraphImpl.Config)

Type Members

  1. final class EdgeSet extends This.EdgeSet
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  2. final class NodeSet extends This.NodeSet with This.NodeSet
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  3. class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()
  4. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]
    Definition Classes
    GraphTraversal
  5. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  6. class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  7. abstract class Component extends Properties
    Definition Classes
    GraphTraversal
  8. case class ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  9. type Config = ConstrainedConfig
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike
  10. trait Cycle extends Path
    Definition Classes
    GraphTraversal
  11. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
    Definition Classes
    GraphTraversal
  12. trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
    Definition Classes
    GraphDegree
  13. type DegreeNodeSeqEntry = (Int, NodeT)
    Definition Classes
    GraphDegree
  14. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
    Definition Classes
    GraphDegree
  15. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  16. trait Edge extends Serializable
    Definition Classes
    GraphBase
  17. class EdgeBase extends InnerEdgeParam[N, E, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  18. type EdgeFilter = (EdgeT) => Boolean
    Definition Classes
    GraphBase
  19. class EdgeImpl extends mutable.AdjacencyListGraph.This.EdgeBase
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  20. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  21. type EdgeSetT = EdgeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  22. type EdgeT = EdgeImpl
    Definition Classes
    AdjacencyListGraph → GraphLike → GraphBase
  23. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  24. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) => U
    Definition Classes
    GraphTraversal
  25. trait Filter[T] extends (T) => Boolean
    Definition Classes
    GraphDegree
  26. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  27. trait Impl[A, +This <: GraphTraversalImpl.Traverser[A, This] with GraphTraversalImpl.Impl[A, This]] extends GraphTraversalImpl.TraverserMethods[A, This] with GraphTraversalImpl.Traverser[A, This]
    Attributes
    protected[collection]
    Definition Classes
    TraverserImpl
  28. trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  29. case class InnerEdgeTraverser extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  31. case class InnerElemTraverser extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  32. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  33. case class InnerNodeDownUpTraverser extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  34. abstract class InnerNodeImpl extends mutable.AdjacencyListGraph.This.NodeBase with mutable.AdjacencyListGraph.This.InnerNode with mutable.AdjacencyListGraph.This.InnerNode
    Definition Classes
    AdjacencyListGraph
  35. trait InnerNodeOps extends AnyRef
    Definition Classes
    EdgeOps
  36. trait InnerNodeState extends AnyRef
    Definition Classes
    State
  37. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
    Definition Classes
    GraphTraversalImpl
  38. case class InnerNodeTraverser extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  39. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  40. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  41. type Layers = Iterable[Layer]
    Definition Classes
    GraphTraversal
  42. abstract class LazyPath extends (GraphTraversalImpl.this)#Path
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. final class MapPathTraversable[T] extends Iterable[T]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  44. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  45. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  46. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  47. trait Node extends Serializable
    Definition Classes
    GraphBase
  48. type NodeFilter = (NodeT) => Boolean
    Definition Classes
    GraphBase
  49. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  50. type NodeSetT = NodeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  51. type NodeT = NodeBase
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  52. case class OuterEdgeTraverser extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  53. case class OuterElemTraverser extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  54. case class OuterNodeDownUpTraverser extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  55. case class OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  56. trait Path extends Walk
    Definition Classes
    GraphTraversal
  57. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
    Definition Classes
    GraphTraversalImpl
  58. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  59. final class ReverseStackTraversable[S <: NodeElement] extends Iterable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  60. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  61. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  62. case class StrongComponentTraverser extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  63. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  64. type ThisGraph = UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  65. type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  66. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  67. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[A]
    Definition Classes
    GraphTraversal
  68. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  69. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  70. trait Walk extends Iterable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  71. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
    Definition Classes
    GraphTraversalImpl
  72. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  73. class Weight extends AnyRef
    Definition Classes
    GraphTraversal

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]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. def &=(coll: Iterable[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
  5. final def &~(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  6. def +(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike → GraphLike
  7. final def +(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphOps
  8. final def +#(e: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  9. final def +#?(e: E[N]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  10. final def ++(that: scala.collection.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  11. final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  12. final def ++=(xs: scala.collection.IterableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  13. def ++=?(elems: TraversableOnce[Param[N, E]]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as ++= but $Info.

    Same as ++= but $Info.

    Definition Classes
    GraphLike → GraphOps
  14. def ++?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as ++ but $Info.

    Same as ++ but $Info.

    Definition Classes
    GraphLike → GraphOps
  15. final def +=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  16. final def +=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  17. final def +=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  18. def +=#?(edge: E[N]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]
    Attributes
    protected
    Definition Classes
    GraphOps
  19. def +=?(elem: Param[N, E]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as += but $Info.

    Same as += but $Info.

    Definition Classes
    GraphOps
  20. def +=?(node: N): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as += but $Info.

    Same as += but $Info.

    Definition Classes
    GraphOps
  21. def +?(node: N): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as + but $Info.

    Same as + but $Info.

    Definition Classes
    GraphLike → GraphOps
  22. def +?(elem: Param[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as + but $Info.

    Same as + but $Info.

    Definition Classes
    GraphLike → GraphOps
  23. final def +~%+=[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. final def +~%+=[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  25. final def +~%=[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~%=[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def +~+=[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  28. final def +~+=[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  29. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  30. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  31. final def -(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphOps
  32. final def -(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  33. final def -(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. final def -!(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  35. final def -!#(edge: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  36. def -!=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
  37. final def -!=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  38. final def -#(e: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  39. final def -#?(e: E[N]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  40. final def --(elems: scala.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphOps
  41. final def --!=(coll: Iterable[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  42. final def --=(xs: scala.collection.IterableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  43. def --=?(elems: TraversableOnce[Param[N, E]]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as --= but $Info.

    Same as --= but $Info.

    Definition Classes
    GraphLike → GraphOps
  44. def --?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as -- but $Info.

    Same as -- but $Info.

    Definition Classes
    GraphLike → GraphOps
  45. final def -=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  46. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type
    Definition Classes
    Shrinkable
  47. final def -=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  48. final def -=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  49. def -=#?(edge: E[N]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]
    Attributes
    protected
    Definition Classes
    GraphOps
  50. def -=?(elem: Param[N, E]): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as -= but $Info.

    Same as -= but $Info.

    Definition Classes
    GraphOps
  51. def -=?(node: N): Either[ConstraintViolation, UserConstrainedGraphImpl.this.type]

    Same as -= but $Info.

    Same as -= but $Info.

    Definition Classes
    GraphOps
  52. def ->[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  53. final def -?(node: N): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as - but $Info.

    Same as - but $Info.

    Definition Classes
    GraphLike → GraphOps
  54. def -?(elem: Param[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]

    Same as - but $Info.

    Same as - but $Info.

    Definition Classes
    GraphLike → GraphOps
  55. final def -?=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  56. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  57. var _edges: EdgeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  58. var _nodes: NodeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  59. final def add(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  60. final def add(node: N): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  61. def addAll(elems: TraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Growable
  62. final def addAndGet(edge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  63. final def addAndGet(node: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  64. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  65. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. def addAndGetLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
  67. final def addAndGetLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. def addAndGetWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  69. final def addAndGetWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. def addAndGetWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  71. final def addAndGetWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  72. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  73. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  74. final def addLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  75. final def addLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  76. def addOne(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Growable
  77. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  78. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  79. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  80. final def addWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  81. final def addWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  82. final def addWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  83. final def addWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  84. def add_?(edge: E[N]): Either[ConstraintViolation, Boolean]

    Same as add but $Info.

    Same as add but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  85. def add_?(node: N): Either[ConstraintViolation, Boolean]

    Same as add but $Info.

    Same as add but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  86. 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
  87. def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  88. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  89. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  90. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  91. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  92. final def apply(elem: Param[N, E]): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  93. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  94. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  95. final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphAsSet
  96. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  97. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  98. def checkedMinusEdge(edge: E[N], simple: Boolean, copy: (E[N], EdgeT) => DefaultGraphImpl[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  99. def checkedMinusNode(node: N, forced: Boolean, copy: (N, NodeT) => DefaultGraphImpl[N, E]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  100. def checkedPlus(contained: => Boolean, preAdd: => PreCheckResult, copy: => DefaultGraphImpl[N, E], nodes: => Iterable[N], edges: => Iterable[E[N]]): Either[ConstraintViolation, DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphLike
  101. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  102. final def clear(): Unit
    Definition Classes
    AdjacencyListGraph → Clearable
    Annotations
    @inline()
  103. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  104. final def clone(): UserConstrainedGraphImpl.this.type
    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
    Annotations
    @inline()
  105. final def coll: UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  106. def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  107. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    IterableOnceOps
  108. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  109. def compose[A](g: (A) => Param[N, E]): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  110. final def concat(elems: scala.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphOps
  111. def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
  112. final def config: DefaultGraphImpl.Config with Config
    Definition Classes
    DefaultGraphImpl → GraphLike
  113. final val constraint: Constraint[N, [+X]E[X], DefaultGraphImpl[N, E]]
    Definition Classes
    UserConstrainedGraphImpl → UserConstrainedGraph
  114. final val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    UserConstrainedGraphImpl → GraphLike
  115. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetOps
  116. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  117. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  118. def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  119. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  120. def count(p: (Param[N, E]) => Boolean): Int
    Definition Classes
    IterableOnceOps
  121. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  122. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  123. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  124. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  125. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  126. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  127. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  128. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  129. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  130. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  131. def diff(that: AnySet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphAsSet → SetOps
  132. def drop(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  133. def dropRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  134. def dropWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  135. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  136. def dumpDirty: ExtBitSet
    Definition Classes
    State
  137. def dumpInUse: ExtBitSet
    Definition Classes
    State
  138. def edgeIterator: Iterator[EdgeT]
    Definition Classes
    AdjacencyListBase
  139. implicit val edgeT: ClassTag[E[N]]
    Definition Classes
    UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
  140. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  141. final def edges: EdgeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  142. final def empty: DefaultGraphImpl[N, E]
    Definition Classes
    DefaultGraphImpl → Graph → Graph → Graph → Graph → GraphAsSet → IterableFactoryDefaults → IterableOps
    Annotations
    @inline()
  143. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) => Boolean, msg: => Any): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  144. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) => Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  145. def ensuring(cond: Boolean, msg: => Any): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  146. def ensuring(cond: Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEnsuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  147. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  148. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → Set → Equals → AnyRef → Any
  149. def excl(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  150. def exists(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  151. final def expectedMaxNodes(divisor: Int, min: Int): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  152. def filter(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  153. def filterNot(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  154. final def find(outerEdge: E[N]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  155. final def find(outerNode: N): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  156. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  157. final def findCycle[U](implicit visitor: (InnerElem) => U): Option[Cycle]
    Definition Classes
    GraphTraversal
  158. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) => U): Option[Cycle]
    Definition Classes
    GraphTraversal
  159. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  160. def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  161. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  162. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  163. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  164. final def forInDegrees(nodes: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  165. def forall(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  166. def foreach[U](f: (Param[N, E]) => U): Unit
    Definition Classes
    IterableOnceOps
  167. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toStringFormat[UserConstrainedGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  168. def fromSpecific(coll: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  169. final def get(outerEdge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  170. final def get(outerNode: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  171. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  172. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  173. final def getOrElse(outerNode: N, default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  174. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImpl → GraphLike → GraphAsSet
  175. def graphSize: Int
    Definition Classes
    GraphBase
  176. def groupBy[K](f: (Param[N, E]) => K): Map[K, DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  177. def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
    Definition Classes
    IterableOps
  178. def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  179. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  180. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  181. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  182. def head: Param[N, E]
    Definition Classes
    IterableOps
  183. def headOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  184. def incl(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  185. def init: DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  186. def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  187. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  188. def inits: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  189. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  190. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  191. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  192. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  193. def intersect(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
  194. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  195. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  196. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  197. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  198. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  199. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  200. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  201. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  202. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  203. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  204. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  205. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  206. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  207. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  208. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  209. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  210. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  211. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  212. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  213. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  214. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  215. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  216. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Iterable → IterableOps
  217. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → IterableOnce
  218. def knownSize: Int
    Definition Classes
    GraphLike → Growable → IterableOnce
  219. def last: Param[N, E]
    Definition Classes
    IterableOps
  220. def lastOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  221. def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, UserConstrainedGraphImpl.this.type]
    Definition Classes
    Iterable
  222. def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): DefaultGraphImpl[NN, EE]
    Definition Classes
    GraphAsSet
  223. def map[B](f: (Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  224. def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  225. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  226. def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  227. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  228. def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  229. def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  230. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  231. def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  232. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  233. def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  234. final def minusIsolated(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  235. def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  236. def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  237. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  238. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  239. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  240. val n1: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  241. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  242. final def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  243. final def newEdgeTArray(size: Int): Array[EdgeT]
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  244. final def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  245. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  246. final def newNodeWithHints(n: N, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  247. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  248. def newSpecificBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  249. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  250. def nextHandle: Handle
    Attributes
    protected
    Definition Classes
    State
  251. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  252. final def nodes: NodeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  253. def nodesToAdd(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  254. def nodesToCEdgeCont[EE[+X] <: E[X] with CHyperEdgeBound[X]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  255. def nodesToCEdgeCont[EE[+X] <: E[X] with CEdgeBound[X]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  256. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  257. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  258. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  259. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  260. final def nodesToLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  261. final def nodesToLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  262. def nodesToLEdgeCont[EE[+X] <: E[X] with LEdgeBound[X], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  263. def nodesToLEdgeCont[EE[+X] <: E[X] with LHyperEdgeBound[X], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  264. final def nodesToWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  265. final def nodesToWEdge[EE[+X] <: E[X] with WEdgeBound[X]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  266. def nodesToWEdgeCont[EE[+X] <: E[X] with WEdgeBound[X]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  267. def nodesToWEdgeCont[EE[+X] <: E[X] with WHyperEdgeBound[X]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  268. final def nodesToWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  269. final def nodesToWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  270. def nodesToWLEdgeCont[EE[+X] <: E[X] with WLEdgeBound[X], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  271. def nodesToWLEdgeCont[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  272. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  273. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  274. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  275. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  276. def order: Int
    Definition Classes
    GraphBase
  277. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  278. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  279. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  280. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  281. final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  282. def partition(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps
  283. def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  284. def pipe[B](f: (UserConstrainedGraphImpl[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  285. def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  286. def postAdd(newGraph: DefaultGraphImpl[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, DefaultGraphImpl[N, E]]
    Definition Classes
    UserConstrainedGraph
  287. def postSubtract(newGraph: DefaultGraphImpl[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, DefaultGraphImpl[N, E]]
    Definition Classes
    UserConstrainedGraph
  288. def preAdd(elems: InParam[N, E]*): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  289. def preAdd(edge: E[N]): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  290. def preAdd(node: N): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  291. def preCreate(nodes: Iterable[N], edges: Iterable[E[N]]): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  292. def preSubtract(nodes: => Set[NodeT], edges: => Set[EdgeT], simple: Boolean): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  293. def preSubtract(edge: EdgeT, simple: Boolean): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  294. def preSubtract(node: NodeT, forced: Boolean): PreCheckResult
    Definition Classes
    UserConstrainedGraph
  295. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  296. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  297. def reduce[B >: Param[N, E]](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  298. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  299. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
    Definition Classes
    IterableOnceOps
  300. def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  301. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  302. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  303. def releaseHandle(handle: Handle): Unit
    Attributes
    protected
    Definition Classes
    State
  304. final def remove(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  305. final def remove(node: N): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  306. final def removeGently(node: N): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  307. final def removeWithNodes(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  308. def remove_?(edge: E[N]): Either[ConstraintViolation, Boolean]

    Same as remove but $Info.

    Same as remove but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  309. def remove_?(node: N): Either[ConstraintViolation, Boolean]

    Same as remove but $Info.

    Same as remove but $Info.

    Definition Classes
    AdjacencyListGraph → GraphOps
  310. def reversed: Iterable[Param[N, E]]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  311. def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
    Definition Classes
    IterableOps
  312. def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  313. def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
    Definition Classes
    IterableOps
  314. final val self: UserConstrainedGraphImpl[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
    UserConstrainedGraphImpl → ConstraintMethods
  315. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  316. def size: Int
    Definition Classes
    IterableOnceOps
  317. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  318. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  319. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  320. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  321. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  322. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  323. def span(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  324. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  325. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
    Definition Classes
    IterableOnce
  326. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → Set → Iterable
  327. def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  328. def subsetOf(that: Set[Param[N, E]]): Boolean
    Definition Classes
    SetOps
  329. def subsets(): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetOps
  330. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetOps
  331. def subtractAll(xs: scala.collection.IterableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    Shrinkable
  332. def subtractOne(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Shrinkable
  333. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  334. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  335. def tail: DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  336. def tails: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  337. def take(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  338. def takeRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  339. def takeWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  340. def tap[U](f: (UserConstrainedGraphImpl[N, E]) => U): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  341. def tapEach[U](f: (Param[N, E]) => U): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  342. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Definition Classes
    IterableOnceOps
  343. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  344. final def toBuffer[B >: Param[N, E]]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  345. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  346. final def toIterable: UserConstrainedGraphImpl.this.type
    Definition Classes
    Iterable → IterableOps
  347. def toList: List[Param[N, E]]
    Definition Classes
    IterableOnceOps
  348. def toMSet: MSet[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableEnrichments[Param[N, E]] performed by method IterableEnrichments in scalax.collection.Compat.
    Definition Classes
    IterableEnrichments
  349. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  350. def toSeq: Seq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  351. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    IterableOnceOps
  352. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  353. def toString(): String
    Definition Classes
    GraphLike → Set → Function1 → Iterable → AnyRef → Any
  354. def toVector: Vector[Param[N, E]]
    Definition Classes
    IterableOnceOps
  355. final def topologicalSort[U](implicit visitor: (InnerElem) => U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  356. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) => U): Iterable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  357. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) => Boolean): Int
    Definition Classes
    GraphDegree
  358. def totalWeight: Double
    Definition Classes
    GraphBase
  359. def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
    Definition Classes
    IterableOps
  360. final def union(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  361. def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  362. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
    Definition Classes
    IterableOps
  363. final def upsert(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  364. val value: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  365. def view: View[Param[N, E]]
    Definition Classes
    IterableOps
  366. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  367. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  368. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  369. def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
    Definition Classes
    IterableOps
  370. def withHandle[T](reuse: Option[Handle])(block: (Handle) => T): T
    Attributes
    protected
    Definition Classes
    State
  371. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) => T): T
    Attributes
    protected
    Definition Classes
    State
  372. final def withoutChecks[R](exec: => R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  373. def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
    Definition Classes
    IterableOps
  374. def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
    Definition Classes
    IterableOps
  375. def zipWithIndex: AnySet[(Param[N, E], Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  376. final def |(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  377. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  378. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toEdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  379. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  380. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  381. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  382. 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 UserConstrainedGraphImpl[N, E] toany2stringadd[UserConstrainedGraphImpl[N, E]] 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:
    (userConstrainedGraphImpl: any2stringadd[UserConstrainedGraphImpl[N, E]]).+(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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: (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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: (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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. val self: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toChainingOps[UserConstrainedGraphImpl[N, E]] 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:
    (userConstrainedGraphImpl: ChainingOps[UserConstrainedGraphImpl[N, E]]).self
    Definition Classes
    ChainingOps
  6. val self: Iterable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toIterableEnrichments[Param[N, E]] performed by method IterableEnrichments in scalax.collection.Compat.
    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:
    (userConstrainedGraphImpl: IterableEnrichments[Param[N, E]]).self
    Definition Classes
    IterableEnrichments
  7. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] 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:
    (userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).stringPrefix
    Definition Classes
    NodeParam
  8. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) => Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toOuterNode[UserConstrainedGraphImpl[N, E]] 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:
    (userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[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. final def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= (addAll) instead of varargs +=

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

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

  5. def -!(elem: Param[N, E]): DefaultGraphImpl[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.

  6. def --!(elems: IterableOnce[Param[N, E]]): DefaultGraphImpl[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.

  7. def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  8. 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 /:

  9. def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  10. 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 :\

  11. 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.

  12. def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  13. 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

  14. def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  15. 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

  16. def count(f: (Param[N, E]) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  17. def exists(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  18. def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  19. 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.

  20. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  21. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: 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

  22. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  23. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  24. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  25. def forall(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  26. def foreach[U](f: (Param[N, E]) => U): Unit
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  27. 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)

  28. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  29. def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: 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

  30. def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  31. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  32. def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  33. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  34. def mkString: String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  35. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  36. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  37. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  38. def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  39. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  40. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  41. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  42. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  43. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  44. 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 UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  45. final def repr: DefaultGraphImpl[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

  46. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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

  47. def seq: UserConstrainedGraphImpl.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  48. def size: Int
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  49. def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  50. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  51. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  52. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  53. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  54. final def toIterable: Iterable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  55. def toIterator: Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

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

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

  57. def toList: List[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  58. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  59. def toSeq: Seq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  60. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  61. def toStream: Stream[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  62. 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

  63. final def toTraversable: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

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

    (Since version 2.13.0) Use toIterable instead

  65. def toVector: Vector[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  66. 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)

  67. def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] 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:
    (userConstrainedGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  68. def →[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] toArrowAssoc[UserConstrainedGraphImpl[N, E]] 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 UserConstrainedGraph[N, E, DefaultGraphImpl[N, E]]

Inherited from DefaultGraphImpl[N, E]

Inherited from GraphTraversalImpl[N, E]

Inherited from State[N, E]

Inherited from TraverserImpl[N, E]

Inherited from AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from mutable.AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from AdjacencyListBase[N, E, DefaultGraphImpl]

Inherited from AddSubtract[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Graph[N, E]

Inherited from GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

Inherited from GraphOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

Inherited from constrained.Graph[N, E]

Inherited from constrained.GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

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

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

Inherited from constrained.GraphOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

Inherited from mutable.Graph[N, E]

Inherited from mutable.GraphLike[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

Inherited from EdgeOps[N, E, [X, Y[+X]]DefaultGraphImpl[X, Y]]

Inherited from Cloneable[DefaultGraphImpl[N, E]]

Inherited from Cloneable

Inherited from Shrinkable[Param[N, E]]

Inherited from Growable[Param[N, E]]

Inherited from Clearable

Inherited from collection.Graph[N, E]

Inherited from collection.GraphLike[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from GraphAsSet[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]]

Inherited from Set[Param[N, E]]

Inherited from Equals

Inherited from SetOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[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], [_]AnySet[_], DefaultGraphImpl[N, E]]

Inherited from IterableOnceOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]]

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

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion EdgeAssoc fromUserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]]

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

Inherited by implicit conversion anyToNode fromUserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]]

Inherited by implicit conversion ChainingOps fromUserConstrainedGraphImpl[N, E] to ChainingOps[UserConstrainedGraphImpl[N, E]]

Inherited by implicit conversion IterableEnrichments fromUserConstrainedGraphImpl[N, E] to IterableEnrichments[Param[N, E]]

Inherited by implicit conversion any2stringadd fromUserConstrainedGraphImpl[N, E] to any2stringadd[UserConstrainedGraphImpl[N, E]]

Inherited by implicit conversion StringFormat fromUserConstrainedGraphImpl[N, E] to StringFormat[UserConstrainedGraphImpl[N, E]]

Inherited by implicit conversion Ensuring fromUserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]]

Inherited by implicit conversion ArrowAssoc fromUserConstrainedGraphImpl[N, E] to ArrowAssoc[UserConstrainedGraphImpl[N, E]]

Ungrouped