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
  • Tree
  • UserConstrainedGraphImpl
c

scalax.collection.constrained.mutable

UserConstrainedGraphImpl

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

Annotations
@SerialVersionUID()
Linear Supertypes
UserConstrainedGraph[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], Graph[N, E], GraphLike[N, E, DefaultGraphImpl], constrained.Graph[N, E], constrained.GraphLike[N, E, DefaultGraphImpl], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], mutable.Graph[N, E], mutable.GraphLike[N, E, DefaultGraphImpl], Mutable, EdgeOps[N, E, DefaultGraphImpl], Cloneable[Graph[N, E]], Cloneable, Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, collection.Graph[N, E], collection.GraphLike[N, E, DefaultGraphImpl], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, Set[Param[N, E]], SetLike[Param[N, E], DefaultGraphImpl[N, E]], Subtractable[Param[N, E], DefaultGraphImpl[N, E]], GenSet[Param[N, E]], GenericSetTemplate[Param[N, E], Set], GenSetLike[Param[N, E], DefaultGraphImpl[N, E]], Iterable[Param[N, E]], IterableLike[Param[N, E], DefaultGraphImpl[N, E]], Equals, GenIterable[Param[N, E]], GenIterableLike[Param[N, E], DefaultGraphImpl[N, E]], Traversable[Param[N, E]], GenTraversable[Param[N, E]], GenericTraversableTemplate[Param[N, E], Set], TraversableLike[Param[N, E], DefaultGraphImpl[N, E]], GenTraversableLike[Param[N, E], DefaultGraphImpl[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]], HasNewBuilder[Param[N, E], DefaultGraphImpl[N, E]], (Param[N, E]) ⇒ Boolean, AnyRef, Any
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. Graph
  11. GraphLike
  12. Graph
  13. GraphLike
  14. Constrained
  15. ConstraintHandlerMethods
  16. ConstraintMethods
  17. Graph
  18. GraphLike
  19. Mutable
  20. EdgeOps
  21. Cloneable
  22. Cloneable
  23. Cloneable
  24. Shrinkable
  25. Growable
  26. Clearable
  27. Graph
  28. GraphLike
  29. GraphDegree
  30. GraphTraversal
  31. GraphBase
  32. Serializable
  33. Serializable
  34. Set
  35. SetLike
  36. Subtractable
  37. GenSet
  38. GenericSetTemplate
  39. GenSetLike
  40. Iterable
  41. IterableLike
  42. Equals
  43. GenIterable
  44. GenIterableLike
  45. Traversable
  46. GenTraversable
  47. GenericTraversableTemplate
  48. TraversableLike
  49. GenTraversableLike
  50. Parallelizable
  51. TraversableOnce
  52. GenTraversableOnce
  53. FilterMonadic
  54. HasNewBuilder
  55. Function1
  56. AnyRef
  57. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by CollectionsHaveToParArray
  4. by EdgeAssoc
  5. by predicateToNodePredicate
  6. by TraversableEnrichments
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. class EdgeSet extends This.EdgeSet
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  2. class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()
  3. class NodeSet extends DefaultGraphImpl.NodeSet with DefaultGraphImpl.NodeSet
    Definition Classes
    DefaultGraphImpl
  4. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[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 = UserConstrainedGraphImpl.EdgeSet
    Definition Classes
    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[scalax.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 = Traversable[Layer]
    Definition Classes
    GraphTraversal
  42. abstract class LazyPath extends (GraphTraversalImpl.this)#Path
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. final class MapPathTraversable[T] extends Traversable[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 = UserConstrainedGraphImpl.NodeSet
    Definition Classes
    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 Traversable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  60. type Self = DefaultGraphImpl[N, E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  61. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  62. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  63. case class StrongComponentTraverser extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  64. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  65. type ThisGraph = UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  66. type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  67. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  68. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
    Definition Classes
    GraphTraversal
  69. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  70. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  71. trait Walk extends Traversable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  72. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
    Definition Classes
    GraphTraversalImpl
  73. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  74. class Weight extends AnyRef
    Definition Classes
    GraphTraversal
  75. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  6. def +(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike → GraphLike
  7. def +(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike
  9. final def +#(edge: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → GraphLike → SetLike
  11. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  14. def ++=(elems: TraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → GraphLike → Growable
  15. def +=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type
    Definition Classes
    Growable
  18. final def +=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  19. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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()
  20. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  21. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  23. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  25. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    Subtractable
  31. final def -!(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  33. final def -!#(edge: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
  35. final def -!=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E] with constrained.GraphLike[N, E, DefaultGraphImpl] with Set[Param[N, E]] with constrained.Graph[N, E]
    Definition Classes
    GraphLike → GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(elems: TraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Shrinkable
  41. def -=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type
    Definition Classes
    Shrinkable
  44. final def -=#(edge: E[N]): UserConstrainedGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. def ->[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to ArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  46. final def -?(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  47. final def -?=(node: N): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  48. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  51. var _edges: EdgeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  52. var _nodes: NodeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  53. final def add(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  54. final def add(node: N): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  55. final def addAndGet(edge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  56. final def addAndGet(node: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  57. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  58. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  59. def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
  60. final def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  61. def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  62. final def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  63. def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT
    Definition Classes
    EdgeOps
  64. final def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  65. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  67. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  69. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  70. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  71. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  72. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  73. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  74. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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()
  75. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  76. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def allNodes(passedNodes: Traversable[N], passedEdges: Traversable[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
  78. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  79. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  80. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  81. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  82. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  83. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  84. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  85. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  86. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  87. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  88. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  89. def checkedAdd[G >: DefaultGraphImpl[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): DefaultGraphImpl[N, E]

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  90. final def clear(): Unit
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  91. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  92. final def clone(): UserConstrainedGraphImpl.this.type
    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
    Annotations
    @inline()
  93. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  95. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  96. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  97. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  98. final def config: DefaultGraphImpl.Config with Config
    Definition Classes
    DefaultGraphImpl → GraphLike
  99. final val constraint: Constraint[N, E]
    Definition Classes
    UserConstrainedGraphImpl → UserConstrainedGraph
  100. final val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    UserConstrainedGraphImpl → GraphLike
  101. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  102. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  103. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  106. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  108. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  109. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  110. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  111. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  112. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  113. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  114. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  115. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  116. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  117. def diff(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  118. def drop(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  119. def dropRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  120. def dropWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  122. def dumpDirty: ExtBitSet
    Definition Classes
    State
  123. def dumpInUse: ExtBitSet
    Definition Classes
    State
  124. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  125. implicit val edgeT: ClassTag[E[N]]
    Definition Classes
    UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
  126. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  127. final def edges: EdgeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  128. final def empty: DefaultGraphImpl[N, E]
    Definition Classes
    DefaultGraphImpl → Graph → Graph → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  129. 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] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  130. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) ⇒ Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  131. def ensuring(cond: Boolean, msg: ⇒ Any): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  132. def ensuring(cond: Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  133. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  134. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  135. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  136. final def expectedMaxNodes(divisor: Int, min: Int): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  137. def filter(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def filterNot(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  140. final def find(outerEdge: E[N]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  141. final def find(outerNode: N): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  142. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  143. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  144. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  145. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  146. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  147. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  150. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  151. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  152. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  153. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to StringFormat[UserConstrainedGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  154. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  155. final def get(outerEdge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  156. final def get(outerNode: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  157. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  158. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  159. final def getOrElse(outerNode: N, default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  160. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImpl → GraphLike → GraphLike
  161. def graphSize: Int
    Definition Classes
    GraphBase
  162. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  163. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  164. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  165. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  166. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  167. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  168. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  169. def init: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  170. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  171. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  172. def inits: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  173. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  174. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  175. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  176. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  177. def intersect(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  178. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  179. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  180. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  181. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  182. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  183. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  184. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  185. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  186. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  187. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  188. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  189. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  190. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  191. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  192. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  193. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  194. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  195. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  196. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  197. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  198. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  199. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  200. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  201. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  202. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  203. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  204. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  205. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  206. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  207. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  208. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  209. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  210. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  211. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  212. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  213. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  214. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  215. val n1: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  216. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  217. def newBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  218. final def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  219. final def newEdgeTArray(size: Int): Array[EdgeT]
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  220. final def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  221. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  222. final def newNodeWithHints(n: N, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  223. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  224. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  225. def nextHandle: Handle
    Attributes
    protected
    Definition Classes
    State
  226. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  227. final def nodes: NodeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  228. def nodesToAdd(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  229. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  230. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  231. 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()
  232. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  233. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  234. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  235. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  236. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  237. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  238. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  239. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  240. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  241. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  242. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  243. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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()
  244. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  245. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  246. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  247. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  248. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  249. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  250. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  251. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: constrained.Graph[N, E]): Boolean

    This handler is called whenever an addition violates the constraints.

    This handler is called whenever an addition violates the constraints. The provided default implementation is empty.

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

    must be true if the handler has been overridden but it doesn't throw an exception.

    Definition Classes
    UserConstrainedGraph → ConstraintHandlerMethods
  252. def onSubtractionRefused(refusedNodes: Traversable[Graph.NodeT], refusedEdges: Traversable[Graph.EdgeT], graph: constrained.Graph[N, E]): Boolean

    This handler is called whenever a subtraction violates the constraints.

    This handler is called whenever a subtraction violates the constraints. The provided default implementation is empty.

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

    must be true if the handler has been overridden but it doesn't throw an exception.

    Definition Classes
    UserConstrainedGraph → ConstraintHandlerMethods
  253. def order: Int
    Definition Classes
    GraphBase
  254. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  255. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  256. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  257. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  258. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  259. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  260. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  261. def partition(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  262. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  263. def postAdd(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

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

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

    newGraph

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

    passedNodes

    nodes passed to the running add operation

    passedEdges

    edges passed to the running add operation

    preCheck

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  264. def postSubtract(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

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

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

    newGraph

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

    preCheck

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

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

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

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

    elems

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

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  266. def preAdd(edge: E[N]): PreCheckResult

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

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

    edge

    to be added.

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  267. def preAdd(node: N): PreCheckResult

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

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

    node

    to be added

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  268. def preCreate(nodes: Traversable[N], edges: Traversable[E[N]]): PreCheckResult

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

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

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

    nodes

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

    edges

    the outer edges the graph is to be populated with.

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  269. def preSubtract(nodes: ⇒ Set[NodeT], edges: ⇒ Set[EdgeT], simple: Boolean): PreCheckResult

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

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

    nodes

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

    edges

    the inner edges to be subtracted.

    simple

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

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  270. def preSubtract(edge: EdgeT, simple: Boolean): PreCheckResult

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

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

    edge

    the inner edge to be subtracted.

    simple

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

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  271. def preSubtract(node: NodeT, forced: Boolean): PreCheckResult

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

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

    node

    the inner to be subtracted.

    forced

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

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  272. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  273. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  274. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  275. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  277. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  278. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  279. def releaseHandle(handle: Handle): Unit
    Attributes
    protected
    Definition Classes
    State
  280. final def remove(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  281. final def remove(node: N): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  282. final def removeGently(node: N): Boolean
    Definition Classes
    GraphLike
  283. final def removeWithNodes(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  284. def repr: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  285. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  286. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  287. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  288. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  289. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  290. 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
  291. def seq: Set[Param[N, E]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  292. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  293. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  294. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  295. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  296. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  297. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  298. def span(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  299. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  300. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  301. def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  302. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  303. def subsets(): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  304. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  305. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  306. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  307. val t: Set[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  308. def tail: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  309. def tails: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  310. def take(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  311. def takeRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  312. def takeWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  313. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  314. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  315. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  316. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  317. def toCollection(repr: DefaultGraphImpl[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  318. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  319. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  320. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  321. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  322. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  323. def toOuterNodes[E[X <: N] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  324. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to CollectionsHaveToParArray[UserConstrainedGraphImpl[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (UserConstrainedGraphImpl[N, E]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  325. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  326. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  327. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  328. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  329. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  330. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  331. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  332. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  333. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  334. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  335. def totalWeight: Double
    Definition Classes
    GraphBase
  336. def transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  337. def union(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  338. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  339. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  340. final def upsert(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  341. val value: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  342. def view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  343. def view: IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  344. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  345. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  346. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  347. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  348. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  349. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  350. final def withoutChecks[R](exec: ⇒ R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  351. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  352. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  353. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  354. def |(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  355. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  356. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  357. def →[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to ArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  358. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  359. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  360. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  361. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  362. 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] to any2stringadd[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. def filter(p: (Param[N, E]) ⇒ Boolean): TraversableOnce[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[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
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[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
  10. 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
  11. def withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from UserConstrainedGraph[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 Graph[N, E]

Inherited from GraphLike[N, E, DefaultGraphImpl]

Inherited from constrained.Graph[N, E]

Inherited from constrained.GraphLike[N, E, DefaultGraphImpl]

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from mutable.Graph[N, E]

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

Inherited from Mutable

Inherited from EdgeOps[N, E, DefaultGraphImpl]

Inherited from Cloneable[Graph[N, E]]

Inherited from Cloneable

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, DefaultGraphImpl]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[N, E]]

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

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

Inherited from GenSet[Param[N, E]]

Inherited from GenericSetTemplate[Param[N, E], Set]

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

Inherited from Iterable[Param[N, E]]

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

Inherited from Equals

Inherited from GenIterable[Param[N, E]]

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

Inherited from Traversable[Param[N, E]]

Inherited from GenTraversable[Param[N, E]]

Inherited from GenericTraversableTemplate[Param[N, E], Set]

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

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

Inherited from Parallelizable[Param[N, E], ParSet[Param[N, E]]]

Inherited from TraversableOnce[Param[N, E]]

Inherited from GenTraversableOnce[Param[N, E]]

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

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

Inherited from (Param[N, E]) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion MonadOps from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]]

Inherited by implicit conversion CollectionsHaveToParArray from UserConstrainedGraphImpl[N, E] to CollectionsHaveToParArray[UserConstrainedGraphImpl[N, E], T]

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

Inherited by implicit conversion predicateToNodePredicate from UserConstrainedGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean

Inherited by implicit conversion TraversableEnrichments from UserConstrainedGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set]

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

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

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

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

Inherited by implicit conversion alternateImplicit from UserConstrainedGraphImpl[N, E] to ForceImplicitAmbiguity

Ungrouped