Packages

t

scalax.collection.constrained

UserConstrainedGraph

trait UserConstrainedGraph[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E]

Linear Supertypes
Graph[N, E], GraphLike[N, E, Graph], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], collection.Graph[N, E], collection.GraphLike[N, E, Graph], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, Set[Param[N, E]], SetLike[Param[N, E], Graph[N, E]], Subtractable[Param[N, E], Graph[N, E]], GenSet[Param[N, E]], GenericSetTemplate[Param[N, E], Set], GenSetLike[Param[N, E], Graph[N, E]], Iterable[Param[N, E]], IterableLike[Param[N, E], Graph[N, E]], Equals, GenIterable[Param[N, E]], GenIterableLike[Param[N, E], Graph[N, E]], Traversable[Param[N, E]], GenTraversable[Param[N, E]], GenericTraversableTemplate[Param[N, E], Set], TraversableLike[Param[N, E], Graph[N, E]], GenTraversableLike[Param[N, E], Graph[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], Graph[N, E]], HasNewBuilder[Param[N, E], Graph[N, E]], (Param[N, E]) ⇒ Boolean, AnyRef, Any
Known Subclasses
UserConstrainedGraphImpl, UserConstrainedGraphImpl
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UserConstrainedGraph
  2. Graph
  3. GraphLike
  4. Constrained
  5. ConstraintHandlerMethods
  6. ConstraintMethods
  7. Graph
  8. GraphLike
  9. GraphDegree
  10. GraphTraversal
  11. GraphBase
  12. Serializable
  13. Serializable
  14. Set
  15. SetLike
  16. Subtractable
  17. GenSet
  18. GenericSetTemplate
  19. GenSetLike
  20. Iterable
  21. IterableLike
  22. Equals
  23. GenIterable
  24. GenIterableLike
  25. Traversable
  26. GenTraversable
  27. GenericTraversableTemplate
  28. TraversableLike
  29. GenTraversableLike
  30. Parallelizable
  31. TraversableOnce
  32. GenTraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. Function1
  36. AnyRef
  37. 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

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]
    Definition Classes
    GraphTraversal
  2. abstract class Component extends Properties
    Definition Classes
    GraphTraversal
  3. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]
    Definition Classes
    GraphTraversal
  4. abstract type Config <: GraphConfig with GenConstrainedConfig
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  5. trait Cycle extends Path
    Definition Classes
    GraphTraversal
  6. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]
    Definition Classes
    GraphTraversal
  7. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
    Definition Classes
    GraphDegree
  8. type DegreeNodeSeqEntry = (Int, NodeT)
    Definition Classes
    GraphDegree
  9. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
    Definition Classes
    GraphDegree
  10. trait Edge extends Serializable
    Definition Classes
    GraphBase
  11. class EdgeBase extends InnerEdgeParam[N, E, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  12. type EdgeFilter = (EdgeT) ⇒ Boolean
    Definition Classes
    GraphBase
  13. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  14. trait EdgeSet extends (collection.GraphLike.this)#EdgeSet
    Definition Classes
    GraphLike
  15. abstract type EdgeSetT <: EdgeSet
    Definition Classes
    GraphLike → GraphBase
  16. abstract type EdgeT <: InnerEdgeParam[N, E, NodeT, E] with InnerEdge with Serializable
    Definition Classes
    GraphLike → GraphBase
  17. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  18. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) ⇒ U
    Definition Classes
    GraphTraversal
  19. trait Filter[T] extends (T) ⇒ Boolean
    Definition Classes
    GraphDegree
  20. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  22. abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]
    Definition Classes
    GraphTraversal
  23. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  24. abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. trait InnerNode extends (collection.GraphLike.this)#InnerNode with (collection.GraphLike.this)#TraverserInnerNode
    Definition Classes
    GraphLike
  26. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  27. abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]
    Definition Classes
    GraphTraversal
  28. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  29. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  30. type Layers = Traversable[Layer]
    Definition Classes
    GraphTraversal
  31. trait Node extends Serializable
    Definition Classes
    GraphBase
  32. abstract class NodeBase extends (collection.GraphLike.this)#NodeBase with InnerNodeParam[N] with (collection.GraphLike.this)#InnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  33. type NodeFilter = (NodeT) ⇒ Boolean
    Definition Classes
    GraphBase
  34. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  35. trait NodeSet extends (collection.GraphLike.this)#NodeSet
    Definition Classes
    GraphLike
  36. abstract type NodeSetT <: NodeSet
    Definition Classes
    GraphLike → GraphBase
  37. abstract type NodeT <: InnerNode
    Definition Classes
    GraphLike → GraphTraversal → GraphBase
  38. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
    Definition Classes
    GraphTraversal
  39. trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
    Definition Classes
    GraphTraversal
  40. abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  41. abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
    Definition Classes
    GraphTraversal
  42. trait Path extends Walk
    Definition Classes
    GraphTraversal
  43. trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]
    Definition Classes
    GraphTraversal
  44. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  45. type Self = Graph[N, E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  46. abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Traversable[Component]
    Definition Classes
    GraphTraversal
  47. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  48. type ThisGraph = UserConstrainedGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  49. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  50. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
    Definition Classes
    GraphTraversal
  51. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  52. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  53. trait Walk extends Traversable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  54. trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk]
    Definition Classes
    GraphTraversal
  55. class Weight extends AnyRef
    Definition Classes
    GraphTraversal
  56. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +(node: N): Graph[N, E]
    Definition Classes
    GraphLike
  2. abstract def +#(edge: E[N]): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  3. abstract def -(node: N): Graph[N, E]
    Definition Classes
    GraphLike
  4. abstract def -!#(edge: E[N]): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  5. abstract def -#(edge: E[N]): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  6. abstract def -?(node: N): Graph[N, E]
    Definition Classes
    GraphLike
  7. abstract def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser
    Definition Classes
    GraphTraversal
  8. implicit abstract def config: generic.GraphConstrainedCompanion.Config with Config
    Definition Classes
    GraphLike
  9. abstract val constraint: Constraint[N, E]
  10. abstract val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    GraphLike
  11. implicit abstract val edgeT: ClassTag[E[N]]
    Definition Classes
    GraphLike
  12. abstract def edges: EdgeSetT
    Definition Classes
    GraphBase
  13. abstract val graphCompanion: GraphConstrainedCompanion[Graph]
    Definition Classes
    GraphLike → GraphLike
  14. abstract def innerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerEdgeTraverser
    Definition Classes
    GraphTraversal
  15. abstract def innerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerElemTraverser
    Definition Classes
    GraphTraversal
  16. abstract def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeDownUpTraverser
    Definition Classes
    GraphTraversal
  17. abstract def innerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): InnerNodeTraverser
    Definition Classes
    GraphTraversal
  18. abstract def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    GraphBase
  19. abstract def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    GraphBase
  20. abstract def newPathBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder
    Definition Classes
    GraphTraversal
  21. abstract def newWalkBuilder(start: NodeT)(implicit sizeHint: Int, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder
    Definition Classes
    GraphTraversal
  22. abstract def nodes: NodeSetT
    Definition Classes
    GraphBase
  23. abstract def outerEdgeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterEdgeTraverser
    Definition Classes
    GraphTraversal
  24. abstract def outerElemTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterElemTraverser
    Definition Classes
    GraphTraversal
  25. abstract def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeDownUpTraverser
    Definition Classes
    GraphTraversal
  26. abstract def outerNodeTraverser(root: NodeT, parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): OuterNodeTraverser
    Definition Classes
    GraphTraversal
  27. abstract val self: Graph[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
    ConstraintMethods
  28. abstract def strongComponentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): StrongComponentTraverser
    Definition Classes
    GraphTraversal

Concrete 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]]): Graph[N, E]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[Param[N, E]]): Graph[N, E]
    Definition Classes
    GenSetLike
  5. def +(elem: Param[N, E]): Graph[N, E]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  6. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
    Definition Classes
    SetLike
  7. def ++(elems: GenTraversableOnce[Param[N, E]]): UserConstrainedGraph.this.type
    Definition Classes
    GraphLike → GraphLike → SetLike
  8. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike
  11. def -(elem: Param[N, E]): Graph[N, E]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  12. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): Graph[N, E]
    Definition Classes
    Subtractable
  13. def -!(elem: Param[N, E]): Graph[N, E]
    Definition Classes
    GraphLike
  14. def --(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E] with GraphLike[N, E, Graph] with Set[Param[N, E]] with Graph[N, E]
    Definition Classes
    GraphLike → GraphLike → Subtractable
  15. def --!(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E]
    Definition Classes
    GraphLike
  16. def ->[B](y: B): (UserConstrainedGraph[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to ArrowAssoc[UserConstrainedGraph[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  17. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  21. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  22. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  23. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. 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
  25. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  26. final val anyEdge: EdgeFilter
    Definition Classes
    GraphBase
  27. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  28. final val anyNode: NodeFilter
    Definition Classes
    GraphBase
  29. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  30. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  31. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  32. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  33. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  34. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  35. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  36. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  37. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  39. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  40. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  42. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  46. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  48. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  49. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  50. def degreeCount(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  51. def degreeNodeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  52. def degreeNodesMap(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[NodeT]]
    Definition Classes
    GraphDegree
  53. def degreeSeq(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  54. def degreeSet(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  55. def diff(that: GenSet[Param[N, E]]): Graph[N, E]
    Definition Classes
    SetLike → GenSetLike
  56. def drop(n: Int): Graph[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  57. def dropRight(n: Int): Graph[N, E]
    Definition Classes
    IterableLike
  58. def dropWhile(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  60. def empty: Graph[N, E]
    Definition Classes
    Graph → Graph → SetLike → GenericSetTemplate
  61. def ensuring(cond: (UserConstrainedGraph[N, E]) ⇒ Boolean, msg: ⇒ Any): UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to Ensuring[UserConstrainedGraph[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  62. def ensuring(cond: (UserConstrainedGraph[N, E]) ⇒ Boolean): UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to Ensuring[UserConstrainedGraph[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  63. def ensuring(cond: Boolean, msg: ⇒ Any): UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to Ensuring[UserConstrainedGraph[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  64. def ensuring(cond: Boolean): UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to Ensuring[UserConstrainedGraph[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  65. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  66. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  67. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  68. def filter(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def filterNot(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  71. final def find(outerEdge: E[N]): Option[EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  72. final def find(outerNode: N): Option[NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  73. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  74. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  75. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) ⇒ U): Option[Cycle]
    Definition Classes
    GraphTraversal
  76. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  77. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  78. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  81. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  82. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  83. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to StringFormat[UserConstrainedGraph[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  84. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  85. final def get(outerEdge: E[N]): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  86. final def get(outerNode: N): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  87. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  88. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  89. final def getOrElse(outerNode: N, default: NodeT): NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  90. def graphSize: Int
    Definition Classes
    GraphBase
  91. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, Graph[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def grouped(size: Int): Iterator[Graph[N, E]]
    Definition Classes
    IterableLike
  93. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  94. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  95. def having(node: NodeFilter, edge: EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  96. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  97. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def init: Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    GraphBase
  100. def inits: Iterator[Graph[N, E]]
    Definition Classes
    TraversableLike
  101. def intersect(that: GenSet[Param[N, E]]): Graph[N, E]
    Definition Classes
    GenSetLike
  102. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  103. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  104. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  105. final def isCustomEdgeFilter(f: EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  106. final def isCustomNodeFilter(f: NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  107. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  108. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  109. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  110. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  111. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  112. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  113. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  114. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  115. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  116. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  117. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  118. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  119. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  120. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  121. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  122. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  123. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  124. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  125. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Graph[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.

  128. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def maxDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  131. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def minDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  134. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  135. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  136. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. val n1: UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to EdgeAssoc[UserConstrainedGraph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  140. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  141. def newBuilder: Builder[Param[N, E], Graph[N, E]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  142. final val noNode: NodeFilter
    Definition Classes
    GraphBase
  143. def nodesToAdd(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  144. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  146. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  147. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  148. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: 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
  149. def onSubtractionRefused(refusedNodes: Traversable[Graph.NodeT], refusedEdges: Traversable[Graph.EdgeT], graph: 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
  150. def order: Int
    Definition Classes
    GraphBase
  151. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  152. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  153. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  154. def partition(p: (Param[N, E]) ⇒ Boolean): (Graph[N, E], Graph[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): Graph[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  156. def postAdd(newGraph: 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
  157. def postSubtract(newGraph: 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
  158. 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
  159. 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
  160. 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
  161. 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
  162. def preSubtract(nodes: ⇒ Set[Graph.NodeT], edges: ⇒ Set[Graph.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
  163. def preSubtract(edge: Graph.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
  164. def preSubtract(node: Graph.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
  165. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  168. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  171. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def repr: Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  173. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  174. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  175. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  176. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  177. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[Graph[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.

  178. def seq: Set[Param[N, E]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  179. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  181. def slice(from: Int, until: Int): Graph[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  182. def sliding(size: Int, step: Int): Iterator[Graph[N, E]]
    Definition Classes
    IterableLike
  183. def sliding(size: Int): Iterator[Graph[N, E]]
    Definition Classes
    IterableLike
  184. def span(p: (Param[N, E]) ⇒ Boolean): (Graph[N, E], Graph[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  185. def splitAt(n: Int): (Graph[N, E], Graph[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  186. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  187. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  188. def subsets(): Iterator[Graph[N, E]]
    Definition Classes
    SetLike
  189. def subsets(len: Int): Iterator[Graph[N, E]]
    Definition Classes
    SetLike
  190. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  192. val t: Set[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  193. def tail: Graph[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  194. def tails: Iterator[Graph[N, E]]
    Definition Classes
    TraversableLike
  195. def take(n: Int): Graph[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  196. def takeRight(n: Int): Graph[N, E]
    Definition Classes
    IterableLike
  197. def takeWhile(p: (Param[N, E]) ⇒ Boolean): Graph[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  198. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  199. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  200. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  201. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  202. def toCollection(repr: Graph[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  203. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  204. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  205. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  206. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  207. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  208. def toOuterNodes[E[X <: N] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to TraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  209. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to CollectionsHaveToParArray[UserConstrainedGraph[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (UserConstrainedGraph[N, E]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  210. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  211. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  212. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: NodeOrdering, ordEdge: EdgeOrdering): String
    Definition Classes
    GraphLike
  213. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  214. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  215. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  216. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  217. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U): CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  218. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U): Traversable[CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  219. def totalDegree(implicit nodeDegree: DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  220. def totalWeight: Double
    Definition Classes
    GraphBase
  221. 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.

  222. def union(that: GenSet[Param[N, E]]): Graph[N, E]
    Definition Classes
    SetLike → GenSetLike
  223. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  224. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  225. val value: UserConstrainedGraph[N, E]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  226. def view(from: Int, until: Int): IterableView[Param[N, E], Graph[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  227. def view: IterableView[Param[N, E], Graph[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  228. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  229. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  230. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  231. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], Graph[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  232. final def withoutChecks[R](exec: ⇒ R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  233. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Graph[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  234. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Graph[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  235. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[Graph[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  236. def |(that: GenSet[Param[N, E]]): Graph[N, E]
    Definition Classes
    GenSetLike
  237. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to EdgeAssoc[UserConstrainedGraph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  238. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to EdgeAssoc[UserConstrainedGraph[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  239. def →[B](y: B): (UserConstrainedGraph[N, E], B)
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to ArrowAssoc[UserConstrainedGraph[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  240. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  241. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  242. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  243. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  244. 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 UserConstrainedGraph[N, E] to any2stringadd[UserConstrainedGraph[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:
    (userConstrainedGraph: any2stringadd[UserConstrainedGraph[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 UserConstrainedGraph[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:
    (userConstrainedGraph: (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 UserConstrainedGraph[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:
    (userConstrainedGraph: (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 UserConstrainedGraph[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:
    (userConstrainedGraph: (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 UserConstrainedGraph[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:
    (userConstrainedGraph: 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 UserConstrainedGraph[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:
    (userConstrainedGraph: 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 UserConstrainedGraph[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:
    (userConstrainedGraph: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[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:
    (userConstrainedGraph: OuterNode[UserConstrainedGraph[N, E]]).stringPrefix
    Definition Classes
    NodeParam
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[N, E] to OuterNode[UserConstrainedGraph[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:
    (userConstrainedGraph: OuterNode[UserConstrainedGraph[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from UserConstrainedGraph[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:
    (userConstrainedGraph: (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 UserConstrainedGraph[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:
    (userConstrainedGraph: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from Graph[N, E]

Inherited from GraphLike[N, E, Graph]

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from collection.Graph[N, E]

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

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

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

Inherited from GenSet[Param[N, E]]

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

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

Inherited from Iterable[Param[N, E]]

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

Inherited from Equals

Inherited from GenIterable[Param[N, E]]

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

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

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

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

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

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

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

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

Ungrouped