Packages

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

    Traits enabling to implement constraints and use constrained graphs.

    Traits enabling to implement constraints and use constrained graphs.

    Graphs may be constrained dynamically or statically.

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

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

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

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

scalax.collection.constrained.immutable

UserConstrainedGraphImpl

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

Annotations
@SerialVersionUID()
Linear Supertypes
UserConstrainedGraph[N, E], DefaultGraphImpl[N, E], GraphTraversalImpl[N, E], State[N, E], TraverserImpl[N, E], AdjacencyListGraph[N, E, DefaultGraphImpl], immutable.AdjacencyListGraph[N, E, DefaultGraphImpl], AdjacencyListBase[N, E, DefaultGraphImpl], Graph[N, E], constrained.Graph[N, E], GraphLike[N, E, DefaultGraphImpl], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], immutable.Graph[N, E], collection.Graph[N, E], collection.GraphLike[N, E, DefaultGraphImpl], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, Set[Param[N, E]], SetLike[Param[N, E], DefaultGraphImpl[N, E]], Subtractable[Param[N, E], DefaultGraphImpl[N, E]], GenSet[Param[N, E]], GenericSetTemplate[Param[N, E], Set], GenSetLike[Param[N, E], DefaultGraphImpl[N, E]], Iterable[Param[N, E]], IterableLike[Param[N, E], DefaultGraphImpl[N, E]], Equals, GenIterable[Param[N, E]], GenIterableLike[Param[N, E], DefaultGraphImpl[N, E]], Traversable[Param[N, E]], GenTraversable[Param[N, E]], GenericTraversableTemplate[Param[N, E], Set], TraversableLike[Param[N, E], DefaultGraphImpl[N, E]], GenTraversableLike[Param[N, E], DefaultGraphImpl[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]], HasNewBuilder[Param[N, E], DefaultGraphImpl[N, E]], (Param[N, E]) ⇒ Boolean, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UserConstrainedGraphImpl
  2. UserConstrainedGraph
  3. DefaultGraphImpl
  4. GraphTraversalImpl
  5. State
  6. TraverserImpl
  7. AdjacencyListGraph
  8. AdjacencyListGraph
  9. AdjacencyListBase
  10. Graph
  11. Graph
  12. GraphLike
  13. Constrained
  14. ConstraintHandlerMethods
  15. ConstraintMethods
  16. Graph
  17. Graph
  18. GraphLike
  19. GraphDegree
  20. GraphTraversal
  21. GraphBase
  22. Serializable
  23. Serializable
  24. Set
  25. SetLike
  26. Subtractable
  27. GenSet
  28. GenericSetTemplate
  29. GenSetLike
  30. Iterable
  31. IterableLike
  32. Equals
  33. GenIterable
  34. GenIterableLike
  35. Traversable
  36. GenTraversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. GenTraversableLike
  40. Parallelizable
  41. TraversableOnce
  42. GenTraversableOnce
  43. FilterMonadic
  44. HasNewBuilder
  45. Function1
  46. AnyRef
  47. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by CollectionsHaveToParArray
  4. by EdgeAssoc
  5. by predicateToNodePredicate
  6. by TraversableEnrichments
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  5. def +(node: N): DefaultGraphImpl[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  6. def +(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  7. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike
  8. def +#(edge: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  9. def ++(elems: GenTraversableOnce[Param[N, E]]): UserConstrainedGraphImpl.this.type
    Definition Classes
    GraphLike → GraphLike → SetLike
  10. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  11. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  12. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  13. def -(n: N): DefaultGraphImpl[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  14. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  15. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    Subtractable
  16. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  17. def -!#(e: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  18. def -#(e: E[N]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  19. def --(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E] with GraphLike[N, E, DefaultGraphImpl] with Set[Param[N, E]] with constrained.Graph[N, E]
    Definition Classes
    GraphLike → GraphLike → Subtractable
  20. def --!(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
  21. def ->[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to ArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  22. def -?(n: N): DefaultGraphImpl[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  23. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. var _edges: EdgeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  27. var _nodes: NodeSetT
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  28. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  29. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  30. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  31. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def allNodes(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]

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

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

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  33. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  34. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  35. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  36. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  37. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  38. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  39. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  40. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  41. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  42. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  43. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  44. def checkedAdd[G >: DefaultGraphImpl[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): DefaultGraphImpl[N, E]

    generic constrained addition

    generic constrained addition

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph
  45. def checkedSubtractEdge[G >: DefaultGraphImpl[N, E]](edge: E[N], simple: Boolean, copy: (E[N], EdgeT) ⇒ G): DefaultGraphImpl[N, E]

    generic constrained subtraction of edges

    generic constrained subtraction of edges

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph
  46. def checkedSubtractNode[G >: DefaultGraphImpl[N, E]](node: N, forced: Boolean, copy: (N, NodeT) ⇒ G): DefaultGraphImpl[N, E]

    generic constrained subtraction of nodes

    generic constrained subtraction of nodes

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph
  47. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  48. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  49. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  51. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  52. def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  53. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  54. implicit val config: DefaultGraphImpl.Config
    Definition Classes
    UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
  55. final val constraint: Constraint[N, E]
    Definition Classes
    UserConstrainedGraphImpl → UserConstrainedGraph
  56. final val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    UserConstrainedGraphImpl → GraphLike
  57. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  58. final def copy(nodes: Traversable[N], edges: Traversable[E[N]]): DefaultGraphImpl[N, E]
    Definition Classes
    UserConstrainedGraphImpl → AdjacencyListGraph
  59. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  60. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  63. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  65. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  66. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  67. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  68. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  69. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  70. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  71. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  72. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  73. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  74. def diff(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  75. def drop(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  76. def dropRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  77. def dropWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  79. def dumpDirty: ExtBitSet
    Definition Classes
    State
  80. def dumpInUse: ExtBitSet
    Definition Classes
    State
  81. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  82. implicit val edgeT: ClassTag[E[N]]
    Definition Classes
    UserConstrainedGraphImpl → DefaultGraphImpl → GraphLike
  83. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  84. final def edges: EdgeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  85. final def empty: DefaultGraphImpl[N, E]
    Definition Classes
    DefaultGraphImpl → Graph → Graph → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  86. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) ⇒ Boolean, msg: ⇒ Any): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  87. def ensuring(cond: (UserConstrainedGraphImpl[N, E]) ⇒ Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  88. def ensuring(cond: Boolean, msg: ⇒ Any): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  89. def ensuring(cond: Boolean): UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to Ensuring[UserConstrainedGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  90. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  91. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  92. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  93. final def expectedMaxNodes(divisor: Int, min: Int): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  94. def filter(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def filterNot(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  97. final def find(outerEdge: E[N]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  98. final def find(outerNode: N): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  99. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  100. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  101. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  102. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  103. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  104. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  107. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle], includeAnyway: Option[NodeT], includeInDegree: NodeFilter, fillInDegrees: Boolean): TopoSortSetup
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  108. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  109. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  110. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to StringFormat[UserConstrainedGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  111. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  112. final def get(outerEdge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  113. final def get(outerNode: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  114. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  115. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  116. final def getOrElse(outerNode: N, default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  117. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImpl → GraphLike → GraphLike
  118. def graphSize: Int
    Definition Classes
    GraphBase
  119. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  121. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  122. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  123. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  124. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  125. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def init: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  128. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  129. def inits: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  130. def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  131. def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  132. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  133. def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  134. def intersect(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  135. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  136. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  137. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  138. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  139. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  140. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  141. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  142. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  143. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  144. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  145. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  146. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  147. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  148. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  149. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  150. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  151. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  152. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  153. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  154. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  155. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  156. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  157. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  158. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  159. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

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

  161. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  164. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  167. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  168. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  169. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. val n1: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  173. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  174. def newBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  175. final def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  176. final def newEdgeTArray(size: Int): Array[EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  177. final def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  178. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  179. final def newNodeWithHints(n: N, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  180. def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  181. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  182. def nextHandle: Handle
    Attributes
    protected
    Definition Classes
    State
  183. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  184. final def nodes: NodeSetT
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  185. def nodesToAdd(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  186. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  188. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  189. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  190. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: constrained.Graph[N, E]): Boolean

    This handler is called whenever an addition violates the constraints.

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

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

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

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

    This handler is called whenever a subtraction violates the constraints.

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

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintHandlerMethods
  192. def order: Int
    Definition Classes
    GraphBase
  193. def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  194. def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  195. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  196. def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  197. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  198. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  199. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  200. def partition(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  201. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  202. def postAdd(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

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

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

    newGraph

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

    passedNodes

    nodes passed to the running add operation

    passedEdges

    edges passed to the running add operation

    preCheck

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

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

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

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

    newGraph

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

    preCheck

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

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

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

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

    elems

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

    returns

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

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

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

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

    edge

    to be added.

    returns

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

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

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

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

    node

    to be added

    returns

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

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

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

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

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

    nodes

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

    edges

    the outer edges the graph is to be populated with.

    returns

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

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

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

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

    nodes

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

    edges

    the inner edges to be subtracted.

    simple

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

    returns

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

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

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

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

    edge

    the inner edge to be subtracted.

    simple

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

    returns

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

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

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

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

    node

    the inner to be subtracted.

    forced

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

    returns

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

    Definition Classes
    UserConstrainedGraph → ConstraintMethods
  211. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  212. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  213. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  214. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  215. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  216. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  217. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  218. def releaseHandle(handle: Handle): Unit
    Attributes
    protected
    Definition Classes
    State
  219. def repr: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  220. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  221. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  222. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  223. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  224. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

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

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

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

    Definition Classes
    UserConstrainedGraphImpl → ConstraintMethods
  226. def seq: Set[Param[N, E]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  227. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  228. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  229. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  230. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  231. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  232. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  233. def span(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  234. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  235. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  236. def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversalImpl → GraphTraversal
  237. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  238. def subsets(): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  239. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  240. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  241. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  242. val t: Set[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  243. def tail: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  244. def tails: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  245. def take(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  246. def takeRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  247. def takeWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  248. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  249. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  250. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  251. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  252. def toCollection(repr: DefaultGraphImpl[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  253. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  254. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  255. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  256. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  257. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  258. def toOuterNodes[E[X <: N] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  259. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to CollectionsHaveToParArray[UserConstrainedGraphImpl[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (UserConstrainedGraphImpl[N, E]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  260. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  261. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  262. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  263. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  264. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  265. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  266. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  267. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  268. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  269. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  270. def totalWeight: Double
    Definition Classes
    GraphBase
  271. def transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  272. def union(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  273. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  274. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  275. val value: UserConstrainedGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  276. def view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  277. def view: IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  278. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  279. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  280. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  281. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  282. def withHandle[T](reuse: Option[Handle])(block: (Handle) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  283. def withHandles[T](nr: Int, reuse: Array[Handle])(block: (Array[Handle]) ⇒ T): T
    Attributes
    protected
    Definition Classes
    State
  284. final def withoutChecks[R](exec: ⇒ R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  285. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  286. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  287. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  288. def |(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  289. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  290. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to EdgeAssoc[UserConstrainedGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  291. def →[B](y: B): (UserConstrainedGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to ArrowAssoc[UserConstrainedGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  292. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  293. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  294. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  295. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  296. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to any2stringadd[UserConstrainedGraphImpl[N, E]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: any2stringadd[UserConstrainedGraphImpl[N, E]]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[Param[N, E], EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[Param[N, E], EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (Param[N, E]) ⇒ Boolean): TraversableOnce[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).stringPrefix
    Definition Classes
    NodeParam
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to OuterNode[UserConstrainedGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: OuterNode[UserConstrainedGraphImpl[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  11. def withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (userConstrainedGraphImpl: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from UserConstrainedGraph[N, E]

Inherited from DefaultGraphImpl[N, E]

Inherited from GraphTraversalImpl[N, E]

Inherited from State[N, E]

Inherited from TraverserImpl[N, E]

Inherited from AdjacencyListGraph[N, E, DefaultGraphImpl]

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

Inherited from AdjacencyListBase[N, E, DefaultGraphImpl]

Inherited from Graph[N, E]

Inherited from constrained.Graph[N, E]

Inherited from GraphLike[N, E, DefaultGraphImpl]

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from immutable.Graph[N, E]

Inherited from collection.Graph[N, E]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[N, E]]

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

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

Inherited from GenSet[Param[N, E]]

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

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

Inherited from Iterable[Param[N, E]]

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

Inherited from Equals

Inherited from GenIterable[Param[N, E]]

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

Inherited from Traversable[Param[N, E]]

Inherited from GenTraversable[Param[N, E]]

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

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

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

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

Inherited from TraversableOnce[Param[N, E]]

Inherited from GenTraversableOnce[Param[N, E]]

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

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

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

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

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

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

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

Ungrouped