scalax.collection.constrained

GraphLike

trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Set[Param[X, Y[X]]] with Graph[X, Y[X]]] extends collection.GraphLike[N, E, This] with Constrained[N, E]

A template trait for graphs.

This trait provides the common structure and operations of immutable graphs independently of its representation.

If E inherits DirectedEdgeLike the graph is directed, otherwise it is undirected or mixed.

N

the user type of the nodes (vertices) in this graph.

E

the higher kinded type of the edges (links) in this graph.

This

the higher kinded type of the graph itself.

Self Type
This[N, E]
Linear Supertypes
Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, SetLike[Param[N, E], This[N, E]], Subtractable[Param[N, E], This[N, E]], GenSetLike[Param[N, E], This[N, E]], (Param[N, E]) ⇒ Boolean, IterableLike[Param[N, E], This[N, E]], GenIterableLike[Param[N, E], This[N, E]], TraversableLike[Param[N, E], This[N, E]], GenTraversableLike[Param[N, E], This[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], This[N, E]], HasNewBuilder[Param[N, E], This[N, E]], Equals, AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphLike
  2. Constrained
  3. ConstraintHandlerMethods
  4. ConstraintMethods
  5. GraphLike
  6. GraphDegree
  7. GraphTraversal
  8. GraphBase
  9. Serializable
  10. Serializable
  11. SetLike
  12. Subtractable
  13. GenSetLike
  14. Function1
  15. IterableLike
  16. GenIterableLike
  17. TraversableLike
  18. GenTraversableLike
  19. Parallelizable
  20. TraversableOnce
  21. GenTraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. Equals
  25. AnyRef
  26. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by traversable2ops
  4. by EdgeAssoc
  5. by predicateToNodePredicate
  6. by any2stringadd
  7. by any2stringfmt
  8. by any2ArrowAssoc
  9. by any2Ensuring
  10. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract class Component extends Properties

    Attributes
    protected
    Definition Classes
    GraphTraversal
  2. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  3. abstract type Config <: GraphConfig with GenConstrainedConfig

    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  4. trait Cycle extends Path

    Definition Classes
    GraphTraversal
  5. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

    Definition Classes
    GraphDegree
  6. type DegreeNodeSeqEntry = (Int, This.NodeT)

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

    Definition Classes
    GraphDegree
  8. trait Edge extends Serializable

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

    Definition Classes
    GraphBase
  10. sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering

    Definition Classes
    GraphBase
  11. trait EdgeSet extends GraphLike.This.EdgeSet

    Definition Classes
    GraphLike → GraphBase
  12. abstract type EdgeSetT <: This.EdgeSet

    Definition Classes
    GraphLike → GraphBase
  13. abstract type EdgeT <: InnerEdgeParam[N, E, This.NodeT, E] with This.InnerEdge with Serializable

    Definition Classes
    GraphBase
  14. sealed trait ElemOrdering extends AnyRef

    Attributes
    protected
    Definition Classes
    GraphBase
  15. trait ExtendedNodeVisitor extends (GraphTraversal.NodeT) ⇒ VisitorReturn with (GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ VisitorReturn

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversal
  18. trait InnerEdge extends Iterable[GraphBase.NodeT] with Edge with InnerElem

    Definition Classes
    GraphBase
  19. abstract class InnerEdgeTraverser extends Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  20. sealed trait InnerElem extends AnyRef

    Definition Classes
    GraphBase
  21. abstract class InnerElemTraverser extends Traverser[GraphTraversal.InnerElem, InnerElemTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  22. trait InnerNode extends GraphLike.This.InnerNode with GraphLike.This.TraverserInnerNode

    Definition Classes
    GraphLike → GraphBase
  23. abstract class InnerNodeDownUpTraverser extends Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  24. abstract class InnerNodeTraverser extends Traverser[GraphTraversal.NodeT, InnerNodeTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. sealed class NoOrdering extends ElemOrdering

    Definition Classes
    GraphBase
  26. trait Node extends Serializable

    Definition Classes
    GraphBase
  27. abstract class NodeBase extends GraphLike.This.NodeBase with InnerNodeParam[N] with GraphLike.This.InnerNode

    Attributes
    protected
    Definition Classes
    GraphLike → GraphBase
  28. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering

    Definition Classes
    GraphBase
  29. trait NodeSet extends GraphLike.This.NodeSet

    Definition Classes
    GraphLike → GraphBase
  30. abstract type NodeSetT <: This.NodeSet

    Definition Classes
    GraphLike → GraphBase
  31. abstract type NodeT <: This.InnerNode

    Definition Classes
    GraphLike → GraphTraversal → GraphBase
  32. abstract class OuterEdgeTraverser extends Traverser[E[N], OuterEdgeTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  33. trait OuterElemTraverser extends Traverser[OuterElem[N, E], OuterElemTraverser]

    Definition Classes
    GraphTraversal
  34. abstract class OuterNodeDownUpTraverser extends Traverser[(Boolean, N), OuterNodeDownUpTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  35. abstract class OuterNodeTraverser extends Traverser[N, OuterNodeTraverser]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  36. trait Path extends Traversable[OutParam[N, E]]

    Definition Classes
    GraphTraversal
  37. trait Properties extends AnyRef

    Attributes
    protected
    Definition Classes
    GraphTraversal
  38. type Self = This[N, E]

    Attributes
    protected
    Definition Classes
    TraversableLike
  39. type ThisGraph = GraphLike.this.type

    Attributes
    protected
    Definition Classes
    GraphLike
  40. abstract class Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]

    Attributes
    protected
    Definition Classes
    GraphTraversal
  41. trait TraverserInnerNode extends GraphTraversal.InnerNode

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

    Attributes
    protected
    Definition Classes
    GraphTraversal
  43. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike
  44. abstract class Traversal extends AnyRef

    Definition Classes
    GraphTraversal
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) use one of Traverser factory methods instead.

Abstract Value Members

  1. abstract def +(node: N): This[N, E]

    Definition Classes
    GraphLike
  2. abstract def +#(edge: E[N]): This[N, E]

    Attributes
    protected
    Definition Classes
    GraphLike
  3. abstract def -(node: N): This[N, E]

    Definition Classes
    GraphLike
  4. abstract def -!#(edge: E[N]): This[N, E]

    Attributes
    protected
    Definition Classes
    GraphLike
  5. abstract def -#(edge: E[N]): This[N, E]

    Attributes
    protected
    Definition Classes
    GraphLike
  6. abstract def -?(node: N): This[N, E]

    Definition Classes
    GraphLike
  7. abstract def componentTraverser(parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.ComponentTraverser

    Definition Classes
    GraphTraversal
  8. implicit abstract def config: generic.GraphConstrainedCompanion.Config with This.Config

    Definition Classes
    GraphLike
  9. abstract val constraintFactory: ConstraintCompanion[Constraint]

  10. implicit abstract val edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]]

    Definition Classes
    GraphLike
  11. abstract def edges: This.EdgeSetT

    Definition Classes
    GraphBase
  12. abstract def empty: This[N, E]

    Definition Classes
    SetLike
  13. abstract val graphCompanion: GraphConstrainedCompanion[This]

    Definition Classes
    GraphLike → GraphLike
  14. abstract def innerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.InnerEdgeTraverser

    Definition Classes
    GraphTraversal
  15. abstract def innerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.InnerElemTraverser

    Definition Classes
    GraphTraversal
  16. abstract def innerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.InnerNodeDownUpTraverser

    Definition Classes
    GraphTraversal
  17. abstract def innerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.InnerNodeTraverser

    Definition Classes
    GraphTraversal
  18. abstract def newEdge(innerEdge: E[This.NodeT]): This.EdgeT

    Attributes
    protected
    Definition Classes
    GraphBase
  19. abstract def newNode(n: N): This.NodeT

    Attributes
    protected
    Definition Classes
    GraphBase
  20. abstract def nodes: This.NodeSetT

    Definition Classes
    GraphBase
  21. abstract def outerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.OuterEdgeTraverser

    Definition Classes
    GraphTraversal
  22. abstract def outerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.OuterElemTraverser

    Definition Classes
    GraphTraversal
  23. abstract def outerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.OuterNodeDownUpTraverser

    Definition Classes
    GraphTraversal
  24. abstract def outerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: (This.NodeT) ⇒ Boolean, subgraphEdges: (This.EdgeT) ⇒ Boolean, ordering: This.ElemOrdering): This.OuterNodeTraverser

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

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

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

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

    Definition Classes
    ConstraintMethods
  29. 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
  30. abstract def seq: Set[Param[N, E]]

    Definition Classes
    GenSetLike → Parallelizable → GenTraversableOnce
  31. abstract def newTraversal(direction: Direction, nodeFilter: (This.NodeT) ⇒ Boolean, edgeFilter: (This.EdgeT) ⇒ Boolean, nodeVisitor: (This.NodeT) ⇒ VisitorReturn, edgeVisitor: (This.EdgeT) ⇒ Unit, ordering: This.ElemOrdering): This.Traversal

    Definition Classes
    GraphTraversal
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) use one of Traverser factory methods instead.

Concrete Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def &(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  5. def &~(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  6. def +(elem: Param[N, E]): This[N, E]

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

    Definition Classes
    SetLike
  8. def ++(elems: GenTraversableOnce[Param[N, E]]): GraphLike.this.type

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

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

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

    Definition Classes
    TraversableLike
  12. def -(elem: Param[N, E]): This[N, E]

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

    Definition Classes
    Subtractable
  14. def -!(elem: Param[N, E]): This[N, E]

    Definition Classes
    GraphLike
  15. def --(elems: GenTraversableOnce[Param[N, E]]): This[N, E]

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

    Definition Classes
    GraphLike
  17. def ->[B](y: B): (GraphLike[N, E, This], B)

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  18. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  22. object Edge extends Serializable

    Definition Classes
    GraphBase
  23. object InnerEdge extends Serializable

    Definition Classes
    GraphBase
  24. object InnerNode extends Serializable

    Definition Classes
    GraphBase
  25. object Node extends Serializable

    Definition Classes
    GraphBase
  26. object TraverserInnerNode extends Serializable

    Definition Classes
    GraphTraversal
  27. def addString(b: StringBuilder): StringBuilder

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

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

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

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

    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
  32. def allNodes(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]

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

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

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  33. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  34. final val anyEdge: (This.EdgeT) ⇒ Boolean

    Definition Classes
    GraphTraversal
  35. final val anyNode: (This.NodeT) ⇒ Boolean

    Definition Classes
    GraphTraversal
  36. final lazy val anyOrdering: AnyOrdering[N]

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

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

    Definition Classes
    Any
  39. def asParIterable: ParIterable[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  40. def asParSeq: ParSeq[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  41. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String

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

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

    Definition Classes
    IterableLike → Equals
  44. var checkSuspended: Boolean

    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
  45. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

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

    Definition Classes
    TraversableOnce
  48. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  49. def contains(elem: Param[N, E]): Boolean

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. final lazy val defaultEdgeOrdering: This.EdgeOrdering

    Definition Classes
    GraphBase
  56. final lazy val defaultNodeOrdering: This.NodeOrdering

    Definition Classes
    GraphBase
  57. def degreeCount(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]

    Definition Classes
    GraphDegree
  58. def degreeNodeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[(Int, This.NodeT)]

    Definition Classes
    GraphDegree
  59. def degreeNodesMap(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Set[This.NodeT]]

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

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

    Definition Classes
    GraphDegree
  62. def diff(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    SetLike → GenSetLike
  63. def drop(n: Int): This[N, E]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  64. def dropRight(n: Int): This[N, E]

    Definition Classes
    IterableLike
  65. def dropWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike
  66. implicit final def edgeToEdgeCont(e: E[N]): E[This.NodeT]

    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  67. def ensuring(cond: (GraphLike[N, E, This]) ⇒ Boolean, msg: ⇒ Any): GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  68. def ensuring(cond: (GraphLike[N, E, This]) ⇒ Boolean): GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  69. def ensuring(cond: Boolean, msg: ⇒ Any): GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  70. def ensuring(cond: Boolean): GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  71. final def eq(arg0: AnyRef): Boolean

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  74. def filter(p: (Param[N, E]) ⇒ Boolean): This[N, E]

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  80. final def findCycle(visitor: (This.InnerElem) ⇒ Unit): Option[This.Cycle]

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  81. final def findCycle: Option[This.Cycle]

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  82. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  83. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  86. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean

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

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

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  89. final def get(outerEdge: E[N]): This.EdgeT

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

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

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

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

    Definition Classes
    GraphLike
    Annotations
    @inline()
  94. def graphSize: Int

    Definition Classes
    GraphBase
  95. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, This[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike
  96. def grouped(size: Int): Iterator[This[N, E]]

    Definition Classes
    IterableLike
  97. def hasDefiniteSize: Boolean

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

    Definition Classes
    GenSetLike → AnyRef → Any
  99. def having(node: (This.NodeT) ⇒ Boolean, edge: (This.EdgeT) ⇒ Boolean): PartialFunction[Param[N, E], Boolean]

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  102. def ifParSeq[R](isbody: (ParSeq[Param[N, E]]) ⇒ R): (TraversableOps[Param[N, E]])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  103. def init: This[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike
  104. def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

    Attributes
    protected
    Definition Classes
    GraphBase
  105. def inits: Iterator[This[N, E]]

    Definition Classes
    TraversableLike
  106. def intersect(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  107. final def isAcyclic: Boolean

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

    Definition Classes
    GraphTraversal
  109. def isConnected: Boolean

    Definition Classes
    GraphTraversal
  110. final def isCustomEdgeFilter(f: (This.EdgeT) ⇒ Boolean): Boolean

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  111. final def isCustomEdgeVisitor(v: (This.EdgeT) ⇒ Unit): Boolean

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  112. final def isCustomNodeFilter(f: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  113. final def isCustomNodeUpVisitor(v: (This.NodeT) ⇒ Unit): Boolean

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  114. final def isCustomNodeVisitor(v: (This.NodeT) ⇒ VisitorReturn): Boolean

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  115. final def isCyclic: Boolean

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

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  117. lazy val isDirected: Boolean

    Definition Classes
    GraphLike → GraphBase
  118. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  119. def isEmpty: Boolean

    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  120. lazy val isHyper: Boolean

    Definition Classes
    GraphLike → GraphBase
  121. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  122. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  123. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  124. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  125. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  126. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  127. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  128. final def isTraversableAgain: Boolean

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  133. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[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.

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

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

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

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

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

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

    Definition Classes
    GraphDegree
  140. def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): This[N, E]

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

    Attributes
    protected
    Definition Classes
    GraphLike
  142. def mkString: String

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. val n1: GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  146. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  147. def newBuilder: Builder[Param[N, E], This[N, E]]

    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  148. final val noEdgeAction: (This.EdgeT) ⇒ Unit

    Definition Classes
    GraphTraversal
  149. final val noNode: (This.NodeT) ⇒ Boolean

    Definition Classes
    GraphTraversal
  150. final val noNodeAction: (This.NodeT) ⇒ GraphTraversal.VisitorReturn.Value

    Definition Classes
    GraphTraversal
  151. final val noNodeUpAction: (This.NodeT) ⇒ Unit

    Definition Classes
    GraphTraversal
  152. final val noOrdering: This.NoOrdering

    Definition Classes
    GraphBase
  153. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. final def nonTrivial: Boolean

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

    Definition Classes
    AnyRef
  156. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  157. def onAdditionRefused(refusedNodes: Iterable[N], refusedEdges: Iterable[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
    ConstraintHandlerMethods
  158. def onSubtractionRefused(refusedNodes: Iterable[Graph.NodeT], refusedEdges: Iterable[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
    ConstraintHandlerMethods
  159. def order: Int

    Definition Classes
    GraphBase
  160. def par: ParSet[Param[N, E]]

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  164. def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): This[N, E]

    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  165. def postAdd(newGraph: Graph[N, E], passedNodes: Iterable[N], passedEdges: Iterable[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 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
    ConstraintMethods
  166. def postSubtract(newGraph: Graph[N, E], passedNodes: Iterable[N], passedEdges: Iterable[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.

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

    Definition Classes
    ConstraintMethods
  168. def preCreate(nodes: Iterable[N], edges: Iterable[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 possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def repr: This[N, E]

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  182. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[This[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.

  183. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def slice(from: Int, until: Int): This[N, E]

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

    Definition Classes
    IterableLike
  186. def sliding(size: Int): Iterator[This[N, E]]

    Definition Classes
    IterableLike
  187. def span(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])

    Definition Classes
    TraversableLike → GenTraversableLike
  188. def splitAt(n: Int): (This[N, E], This[N, E])

    Definition Classes
    TraversableLike → GenTraversableLike
  189. def stringPrefix: String

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

    Definition Classes
    GenSetLike
  191. def subsets: Iterator[This[N, E]]

    Definition Classes
    SetLike
  192. def subsets(len: Int): Iterator[This[N, E]]

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

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

    Definition Classes
    AnyRef
  195. def tail: This[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike
  196. def tails: Iterator[This[N, E]]

    Definition Classes
    TraversableLike
  197. def take(n: Int): This[N, E]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  198. def takeRight(n: Int): This[N, E]

    Definition Classes
    IterableLike
  199. def takeWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  208. def toList: List[Param[N, E]]

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  210. def toParArray: ParArray[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to TraversableOps[Param[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  211. def toSeq: Seq[Param[N, E]]

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

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

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

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

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  217. def toVector: Vector[Param[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  218. def totalDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Definition Classes
    GraphDegree
  219. def totalWeight: Long

    Definition Classes
    GraphBase
  220. def union(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    SetLike → GenSetLike
  221. val value: GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  222. def view(from: Int, until: Int): IterableView[Param[N, E], This[N, E]]

    Definition Classes
    IterableLike → TraversableLike
  223. def view: IterableView[Param[N, E], This[N, E]]

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

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

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

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

    Definition Classes
    TraversableLike → FilterMonadic
  228. final def withoutChecks[R](exec: ⇒ R): R

    Attributes
    protected
  229. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  230. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That

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

    Definition Classes
    IterableLike → GenIterableLike
  232. def |(that: GenSet[Param[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  233. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  234. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  235. def [B](y: B): (GraphLike[N, E, This], B)

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to StringAdd 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:
    (graphLike: StringAdd).+(other)
    Definition Classes
    StringAdd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[Param[N, E], EI]) ⇒ A

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: (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 information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: (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 information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to StringAdd 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:
    (graphLike: StringAdd).self
    Definition Classes
    StringAdd
  9. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to StringFormat performed by method any2stringfmt 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:
    (graphLike: StringFormat).self
    Definition Classes
    StringFormat
  10. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] 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:
    (graphLike: OuterNode[GraphLike[N, E, This]]).stringPrefix
    Definition Classes
    NodeParam
  11. def toString(): String

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]] 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:
    (graphLike: OuterNode[GraphLike[N, E, This]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  12. def toString(): String

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: (Param[Param[N, E], EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  13. def withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:\[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def findCycle(nodeFilter: (This.NodeT) ⇒ Boolean, edgeFilter: (This.EdgeT) ⇒ Boolean, maxDepth: Int, nodeVisitor: (This.NodeT) ⇒ VisitorReturn, edgeVisitor: (This.EdgeT) ⇒ Unit, ordering: This.ElemOrdering): Option[This.Cycle]

    Definition Classes
    GraphTraversal
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use componentTraverser instead.

  3. def x: GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphLike: ArrowAssoc[GraphLike[N, E, This]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  4. def x: GraphLike[N, E, This]

    Implicit information
    This member is added by an implicit conversion from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphLike: Ensuring[GraphLike[N, E, This]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

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

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

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

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

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

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

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

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

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

Inherited from Equals

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion traversable2ops from GraphLike[N, E, This] to TraversableOps[Param[N, E]]

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

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

Inherited by implicit conversion any2stringadd from GraphLike[N, E, This] to StringAdd

Inherited by implicit conversion any2stringfmt from GraphLike[N, E, This] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from GraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]]

Inherited by implicit conversion any2Ensuring from GraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]]

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

Ungrouped