Class

scalax.collection.constrained.mutable

UserConstrainedGraphImpl

Related Doc: package mutable

Permalink

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
Type Hierarchy Learn more about scaladoc diagrams
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 any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  10. 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)

    Permalink

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]

    Permalink
    Definition Classes
    GraphTraversal
  2. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  3. class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  4. abstract class Component extends Properties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  5. class ComponentImpl extends (GraphTraversalImpl.this)#Component

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  6. case class ComponentTraverser extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  7. type Config = ConstrainedConfig

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike
  8. trait Cycle extends Path

    Permalink
    Definition Classes
    GraphTraversal
  9. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]

    Permalink
    Definition Classes
    GraphTraversal
  10. type CycleStackElem = (NodeT, Iterable[EdgeT])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  11. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

    Permalink
    Definition Classes
    GraphDegree
  12. type DegreeNodeSeqEntry = (Int, NodeT)

    Permalink
    Definition Classes
    GraphDegree
  13. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

    Permalink
    Definition Classes
    GraphDegree
  14. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  15. trait Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
  16. class EdgeBase extends InnerEdgeParam[N, E, GraphBase.NodeT, E] with InnerEdge

    Permalink
    Definition Classes
    GraphBase
  17. type EdgeFilter = (EdgeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  18. class EdgeImpl extends mutable.AdjacencyListGraph.This.EdgeBase

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  19. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  20. class EdgeSet extends This.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  21. type EdgeSetT = UserConstrainedGraphImpl.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  22. type EdgeT = EdgeImpl

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase
  23. sealed trait ElemOrdering extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  24. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) ⇒ U with (GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U

    Permalink
    Definition Classes
    GraphTraversal
  25. trait Filter[T] extends (T) ⇒ Boolean

    Permalink
    Definition Classes
    GraphDegree
  26. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef

    Permalink
    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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    TraverserImpl
  28. trait InnerEdge extends Iterable[GraphBase.NodeT] with InnerEdgeParam[N, E, GraphBase.NodeT, E] with Edge with InnerElem

    Permalink
    Definition Classes
    GraphBase
  29. case class InnerEdgeTraverser extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. sealed trait InnerElem extends AnyRef

    Permalink
    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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  32. trait InnerNode extends (AdjacencyListBase.this)#InnerNode

    Permalink
    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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  34. abstract class InnerNodeImpl extends mutable.AdjacencyListGraph.This.NodeBase with mutable.AdjacencyListGraph.This.InnerNode with mutable.AdjacencyListGraph.This.InnerNode

    Permalink
    Definition Classes
    AdjacencyListGraph
  35. trait InnerNodeOps extends AnyRef

    Permalink
    Definition Classes
    EdgeOps
  36. trait InnerNodeState extends AnyRef

    Permalink
    Definition Classes
    State
  37. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState

    Permalink
    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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  39. case class Layer extends Product with Serializable

    Permalink
    Definition Classes
    GraphTraversal
  40. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]

    Permalink
    Definition Classes
    GraphTraversal
  41. type Layers = Traversable[Layer]

    Permalink
    Definition Classes
    GraphTraversal
  42. abstract class LazyPath extends (GraphTraversalImpl.this)#Path

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. final class MapPathTraversable[T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  44. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  45. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  46. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  47. trait Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
  48. class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl
    Annotations
    @SerialVersionUID()
  49. type NodeFilter = (NodeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  50. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  51. class NodeSet extends DefaultGraphImpl.NodeSet with DefaultGraphImpl.NodeSet

    Permalink
    Definition Classes
    DefaultGraphImpl
  52. type NodeSetT = UserConstrainedGraphImpl.NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  53. type NodeT = NodeBase

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  54. case class OuterEdgeTraverser extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  55. 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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  56. case class OuterNodeDownUpTraverser extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  57. case class OuterNodeTraverser extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  58. trait Path extends Walk

    Permalink
    Definition Classes
    GraphTraversal
  59. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl
  60. trait Properties extends SubgraphProperties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  61. final class ReverseStackTraversable[S, T] extends Traversable[T]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  62. type Self = DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  63. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  64. trait SubgraphProperties extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  65. type ThisGraph = UserConstrainedGraphImpl.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  66. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]

    Permalink
    Definition Classes
    GraphTraversal
  67. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]

    Permalink
    Definition Classes
    GraphTraversal
  68. trait TraverserInnerNode extends GraphTraversal.InnerNode

    Permalink
    Definition Classes
    GraphTraversal
  69. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  70. trait Walk extends Traversable[GraphTraversal.InnerElem]

    Permalink
    Definition Classes
    GraphTraversal
  71. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl
  72. class Weight extends AnyRef

    Permalink
    Definition Classes
    GraphTraversal
  73. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[N, E]]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GenSetLike
  6. def +(node: N): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike → GraphLike
  7. def +(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    SetLike
  9. final def +#(edge: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike → GraphLike → SetLike
  11. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  14. def ++=(elems: TraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike → GraphLike → Growable
  15. def +=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: N): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    Growable
  18. final def +=#(edge: E[N]): UserConstrainedGraphImpl.this.type

    Permalink
    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: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type

    Permalink
    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: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type

    Permalink
    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: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): UserConstrainedGraphImpl.this.type

    Permalink
    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: Long)(implicit edgeFactory: WEdgeCompanion[EE]): UserConstrainedGraphImpl.this.type

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: N): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    Subtractable
  31. final def -!(edge: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
  33. final def -!#(edge: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike
  35. final def -!=#(edge: E[N]): UserConstrainedGraphImpl.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(elems: TraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike → Shrinkable
  41. def -=(elem: Param[N, E]): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: N): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    Shrinkable
  44. final def -=#(edge: E[N]): UserConstrainedGraphImpl.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. def ->[B](y: B): (UserConstrainedGraphImpl[N, E], B)

    Permalink
    Implicit information
    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]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  47. final def -?=(node: N): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  48. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  51. object Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  52. object InnerEdge extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  53. object InnerNode extends Serializable

    Permalink
    Definition Classes
    GraphBase
  54. object Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  55. object TraverserInnerNode extends Serializable

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  56. var _edges: EdgeSetT

    Permalink
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  57. var _nodes: NodeSetT

    Permalink
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  58. final def add(edge: E[N]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  59. final def add(node: N): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  60. final def addAndGet(edge: E[N]): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  61. final def addAndGet(node: N): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  62. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  63. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  64. 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

    Permalink
    Definition Classes
    EdgeOps
  65. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  67. final def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  69. final def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  72. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  73. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  74. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  75. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  76. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  77. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  78. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  79. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  80. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  81. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def allNodes(innerNodes: Set[NodeT], innerEdges: Set[EdgeT]): Set[NodeT]

    Permalink

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

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

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  83. def allNodes(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]

    Permalink

    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
  84. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  85. final val anyEdge: EdgeFilter

    Permalink
    Definition Classes
    GraphBase
  86. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  87. final val anyNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase
  88. final lazy val anyOrdering: AnyOrdering[N]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  89. def apply(elem: Param[N, E]): Boolean

    Permalink
    Definition Classes
    GenSetLike → Function1
  90. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  91. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike
  92. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  93. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  94. var checkSuspended: Boolean

    Permalink

    This flag is used to prevent constraint checking for single additions and subtractions triggered by a multiple addition/subtraction such as ++=.

    This flag is used to prevent constraint checking for single additions and subtractions triggered by a multiple addition/subtraction such as ++=.

    Attributes
    protected
    Definition Classes
    GraphLike
  95. def checkedAdd[G >: DefaultGraphImpl[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): DefaultGraphImpl[N, E]

    Permalink

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  96. final def clear(): Unit

    Permalink
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  97. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State
  98. final def clone(): UserConstrainedGraphImpl.this.type

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
    Annotations
    @inline()
  99. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  101. def companion: GenericCompanion[Set]

    Permalink
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  102. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  103. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  104. final def config: DefaultGraphImpl.Config with Config

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphLike
  105. final val constraint: Constraint[N, E]

    Permalink
  106. final val constraintFactory: ConstraintCompanion[Constraint]

    Permalink
    Definition Classes
    UserConstrainedGraphImplGraphLike
  107. def contains(elem: Param[N, E]): Boolean

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  108. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  109. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  112. def count(p: (Param[N, E]) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. final def cycle(results: (Option[NodeT], ArrayStack[CycleStackElem]), edgeFilter: EdgeFilter): Option[Cycle]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  114. final lazy val defaultEdgeOrdering: EdgeOrdering

    Permalink
    Definition Classes
    GraphBase
  115. final lazy val defaultNodeOrdering: NodeOrdering

    Permalink
    Definition Classes
    GraphBase
  116. final def defaultPathSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  117. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]

    Permalink
    Definition Classes
    GraphDegree
  118. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]

    Permalink
    Definition Classes
    GraphDegree
  119. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]

    Permalink
    Definition Classes
    GraphDegree
  120. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]

    Permalink
    Definition Classes
    GraphDegree
  121. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]

    Permalink
    Definition Classes
    GraphDegree
  122. def diff(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  123. def drop(n: Int): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  124. def dropRight(n: Int): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike
  125. def dropWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def dump(store: FlagStore): ExtBitSet

    Permalink
    Attributes
    protected
    Definition Classes
    State
  127. def dumpDirty: ExtBitSet

    Permalink
    Definition Classes
    State
  128. def dumpInUse: ExtBitSet

    Permalink
    Definition Classes
    State
  129. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }

    Permalink
    Definition Classes
    AdjacencyListBase
  130. implicit val edgeT: ClassTag[E[N]]

    Permalink
    Definition Classes
    UserConstrainedGraphImplDefaultGraphImpl → GraphLike
  131. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  132. final def edges: EdgeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  133. final def empty: DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    DefaultGraphImplGraphGraph → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  134. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) ⇒ Boolean, msg: ⇒ Any): UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  135. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) ⇒ Boolean): UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  136. def ensuring(cond: Boolean, msg: ⇒ Any): UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  137. def ensuring(cond: Boolean): UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  138. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  139. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  140. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  141. final def expectedMaxNodes(divisor: Int, min: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  142. def filter(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def filterNot(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  144. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  145. final def find(outerEdge: E[N]): Option[EdgeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  146. final def find(outerNode: N): Option[NodeT]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  147. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  148. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]

    Permalink
    Definition Classes
    GraphTraversal
  149. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  150. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  151. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  154. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): (Buffer[NodeT], Map[NodeT, Int])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  155. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  156. def foreach[U](f: (Param[N, E]) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  157. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    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()
  158. def genericBuilder[B]: Builder[B, Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  159. final def get(outerEdge: E[N]): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  160. final def get(outerNode: N): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  161. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  162. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  163. final def getOrElse(outerNode: N, default: NodeT): NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  164. final val graphCompanion: DefaultGraphImpl.type

    Permalink
    Definition Classes
    DefaultGraphImplGraphLike → GraphLike
  165. def graphSize: Int

    Permalink
    Definition Classes
    GraphBase
  166. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  167. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    IterableLike
  168. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  169. def hashCode(): Int

    Permalink
    Definition Classes
    GenSetLike → AnyRef → Any
  170. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]

    Permalink
    Definition Classes
    GraphLike
  171. def head: Param[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  172. def headOption: Option[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  173. def init: DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  174. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  175. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  176. def inits: Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    TraversableLike
  177. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  178. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  179. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  180. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  181. def intersect(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GenSetLike
  182. final def isAcyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  183. def isComplete: Boolean

    Permalink
    Definition Classes
    GraphTraversal
  184. def isConnected: Boolean

    Permalink
    Definition Classes
    GraphTraversal
  185. final def isCustomEdgeFilter(f: EdgeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  186. final def isCustomNodeFilter(f: NodeFilter): Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  187. final def isCyclic: Boolean

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  188. def isDefined: Boolean

    Permalink
    Implicit information
    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
  189. def isDirected: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  190. final val isDirectedT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  191. def isEdge: Boolean

    Permalink
    Implicit information
    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
  192. def isEmpty: Boolean

    Permalink
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  193. def isHyper: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  194. final val isHyperT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  195. def isIn: Boolean

    Permalink
    Implicit information
    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
  196. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  197. def isMulti: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  198. final val isMultiT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  199. def isNode: Boolean

    Permalink
    Implicit information
    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
  200. def isOut: Boolean

    Permalink
    Implicit information
    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
  201. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  202. final def isTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  203. def iterator: Iterator[OutParam[N, E] with Serializable with InnerElem]

    Permalink
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  204. def last: Param[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  205. def lastOption: Option[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  206. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

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

  207. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  208. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  209. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  210. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  211. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  212. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  213. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  214. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  215. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  216. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  217. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  218. val n1: UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  219. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  220. def newBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  221. final def newEdge(innerEdge: E[NodeT]): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  222. final def newEdgeTArray(size: Int): Array[EdgeT]

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  223. final def newNode(n: N): NodeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  224. final def newNodeSet: NodeSetT

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  225. final def newNodeWithHints(n: N, h: Hints): NodeBase

    Permalink
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  226. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  227. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  228. def nextHandle: Handle

    Permalink
    Attributes
    protected
    Definition Classes
    State
  229. final val noNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase
  230. final def nodes: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  231. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  232. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  233. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  234. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  235. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  236. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  237. 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

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  238. 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

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  239. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  240. 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]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  241. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  242. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Long, node_1: N, node_2: N): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  243. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Long, node_1: N, node_2: N): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  244. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  245. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  246. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  247. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  248. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  249. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  250. final def nonTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  251. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  252. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  253. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: constrained.Graph[N, E]): Boolean

    Permalink

    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
    UserConstrainedGraphConstraintHandlerMethods
  254. def onSubtractionRefused(refusedNodes: Traversable[Graph.NodeT], refusedEdges: Traversable[Graph.EdgeT], graph: constrained.Graph[N, E]): Boolean

    Permalink

    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
    UserConstrainedGraphConstraintHandlerMethods
  255. def order: Int

    Permalink
    Definition Classes
    GraphBase
  256. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  257. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  258. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  259. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser

    Permalink
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  260. def par: ParSet[Param[N, E]]

    Permalink
    Definition Classes
    Parallelizable
  261. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  262. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  263. def partition(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  264. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  265. def postAdd(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    Permalink

    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 except those coming from node/edge input streams.

    passedEdges

    edges passed to the running add operation except those coming from edge input streams.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  266. def postSubtract(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    Permalink

    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.

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

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  268. def preAdd(edge: E[N]): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  269. def preAdd(node: N): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  270. def preCreate(nodes: Traversable[N], edges: Traversable[E[N]]): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  271. def preSubtract(nodes: ⇒ Set[NodeT], edges: ⇒ Set[EdgeT], simple: Boolean): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  272. def preSubtract(edge: EdgeT, simple: Boolean): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  273. def preSubtract(node: NodeT, forced: Boolean): PreCheckResult

    Permalink

    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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    UserConstrainedGraphConstraintMethods
  274. def product[B >: Param[N, E]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  275. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  277. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  278. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  279. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  280. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  281. def releaseHandle(handle: Handle): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State
  282. final def remove(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  283. final def remove(node: N): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  284. final def removeGently(node: N): Boolean

    Permalink
    Definition Classes
    GraphLike
  285. final def removeWithNodes(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  286. def repr: DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  287. def reversed: List[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  288. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  289. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  290. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  291. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

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

  292. final val self: UserConstrainedGraphImpl[N, E]

    Permalink

    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
    UserConstrainedGraphImplConstraintMethods
  293. def seq: Set[Param[N, E]]

    Permalink
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  294. final def serializeTo(out: ObjectOutputStream): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  295. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  296. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  297. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    IterableLike
  298. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    IterableLike
  299. def span(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  300. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  301. def stringPrefix: String

    Permalink
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  302. def subsetOf(that: GenSet[Param[N, E]]): Boolean

    Permalink
    Definition Classes
    GenSetLike
  303. def subsets(): Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    SetLike
  304. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    SetLike
  305. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  306. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  307. def tail: DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  308. def tails: Iterator[DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    TraversableLike
  309. def take(n: Int): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  310. def takeRight(n: Int): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike
  311. def takeWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  312. def thisCollection: Iterable[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  313. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  314. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  315. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  316. def toCollection(repr: DefaultGraphImpl[N, E]): Iterable[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  317. def toIndexedSeq: IndexedSeq[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  318. def toIterable: Iterable[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  319. def toIterator: Iterator[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  320. def toList: List[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  321. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  322. def toParArray: ParArray[T]

    Permalink
    Implicit information
    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
  323. def toSeq: Seq[Param[N, E]]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  324. def toSet[B >: Param[N, E]]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  325. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike
  326. def toStream: Stream[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  327. def toString(): String

    Permalink
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  328. def toTraversable: Traversable[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  329. def toVector: Vector[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  330. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder

    Permalink
    Definition Classes
    GraphTraversal
  331. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]

    Permalink
    Definition Classes
    GraphTraversal
  332. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  333. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  334. def transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  335. def union(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  336. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  337. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  338. final def upsert(edge: E[N]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  339. val value: UserConstrainedGraphImpl[N, E]

    Permalink
    Implicit information
    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
  340. def view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  341. def view: IterableView[Param[N, E], DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  342. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  343. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  344. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  345. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  346. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State
  347. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    State
  348. final def withoutChecks[R](exec: ⇒ R): R

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  349. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  350. 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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  351. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  352. def |(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GenSetLike
  353. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    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()
  354. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    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()
  355. def [B](y: B): (UserConstrainedGraphImpl[N, E], B)

    Permalink
    Implicit information
    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

Shadowed Implicit Value Members

  1. def +(other: String): String

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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]]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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]]

    Permalink
    Implicit information
    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 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