Class

scalax.collection.constrained.immutable

UserConstrainedGraphImpl

Related Doc: package immutable

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], 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
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. 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 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. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  19. class EdgeSet extends immutable.AdjacencyListGraph.This.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
  20. type EdgeSetT = EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
  21. type EdgeT = EdgeBase

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  26. 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
  27. trait InnerEdge extends Iterable[GraphBase.NodeT] with InnerEdgeParam[N, E, GraphBase.NodeT, E] with Edge with InnerElem

    Permalink
    Definition Classes
    GraphBase
  28. 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
  29. sealed trait InnerElem extends AnyRef

    Permalink
    Definition Classes
    GraphBase
  30. 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
  31. trait InnerNode extends (AdjacencyListBase.this)#InnerNode

    Permalink
    Definition Classes
    AdjacencyListBase
  32. 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
  33. abstract class InnerNodeImpl extends immutable.AdjacencyListGraph.This.NodeBase with immutable.AdjacencyListGraph.This.InnerNode

    Permalink
    Definition Classes
    AdjacencyListGraph
  34. trait InnerNodeState extends AnyRef

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

    Permalink
    Definition Classes
    GraphTraversalImpl
  36. 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
  37. case class Layer extends Product with Serializable

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  46. final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

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

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

    Permalink
    Definition Classes
    GraphBase
  49. class NodeSet extends immutable.AdjacencyListGraph.This.NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph
  50. type NodeSetT = NodeSet

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

    Permalink
    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphTraversal → GraphBase
  52. 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
  53. case class OuterElemTraverser extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversalImpl
  58. trait Properties extends SubgraphProperties

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversalImpl
  70. class Weight extends AnyRef

    Permalink
    Definition Classes
    GraphTraversal
  71. 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 &~(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike
  13. def -(n: N): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  14. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]

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

    Permalink
    Definition Classes
    Subtractable
  16. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    GraphLike
  17. def -!#(e: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  18. def -#(e: E[N]): DefaultGraphImpl[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  19. def --(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]

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

    Permalink
    Definition Classes
    GraphLike
  21. 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()
  22. def -?(n: N): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  23. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  29. object Node extends Serializable

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

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

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl
  33. def addString(b: StringBuilder): StringBuilder

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

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

    Permalink
    Definition Classes
    TraversableOnce
  36. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. 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
  38. 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
  39. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → Equals
  49. 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
  50. def checkedAdd[G >: DefaultGraphImpl[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): DefaultGraphImpl[N, E]

    Permalink

    generic constrained addition

    generic constrained addition

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

    Permalink

    generic constrained subtraction of edges

    generic constrained subtraction of edges

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

    Permalink

    generic constrained subtraction of nodes

    generic constrained subtraction of nodes

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph
  53. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    State
  54. final def clone(): DefaultGraphImpl[N, E]

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

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

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

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

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

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  60. implicit val config: DefaultGraphImpl.Config

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

    Permalink
  62. final val constraintFactory: ConstraintCompanion[Constraint]

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

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  64. final def copy(nodes: Traversable[N], edges: Traversable[E[N]]): DefaultGraphImpl[N, E]

    Permalink
    Definition Classes
    UserConstrainedGraphImpl → AdjacencyListGraph
  65. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  73. final def defaultPathSize: Int

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    State
  85. def dumpInUse: ExtBitSet

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

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

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

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

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

    Permalink
    Definition Classes
    DefaultGraphImplGraphGraph → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  91. 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
  92. 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
  93. 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
  94. 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
  95. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  106. 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
  107. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  111. 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
  112. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  114. 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()
  115. def genericBuilder[B]: Builder[B, Set[B]]

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike
  125. def hasDefiniteSize: Boolean

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSetLike
  139. final def isAcyclic: Boolean

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

    Permalink
    Definition Classes
    GraphTraversal
  141. def isConnected: Boolean

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  145. 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
  146. def isDirected: Boolean

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  148. 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
  149. def isEmpty: Boolean

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  152. 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
  153. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  154. def isMulti: Boolean

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  156. 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
  157. 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
  158. final def isTraversableAgain: Boolean

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  163. 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.

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. 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
  176. final def ne(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  187. final def nodes: NodeSetT

    Permalink
    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  188. def nonEmpty: Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef
  192. 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
  193. 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
  194. def order: Int

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

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  204. 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
  205. 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
  206. 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
  207. 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
  208. 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
  209. 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
  210. 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
  211. 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
  212. 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
  213. def product[B >: Param[N, E]](implicit num: Numeric[B]): B

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    State
  221. def repr: DefaultGraphImpl[N, E]

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  224. 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
  225. 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
  226. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  257. 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
  258. def toSeq: Seq[Param[N, E]]

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphDegree
  268. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  269. 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.

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

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  273. 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
  274. def view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  283. 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
  284. 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
  285. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That

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

    Permalink
    Definition Classes
    GenSetLike
  287. 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()
  288. 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()
  289. 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 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 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