scalax.collection.constrained.mutable

GraphLike

trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends mutable.GraphLike[N, E, This] with constrained.GraphLike[N, E, This] with Growable[GraphParam[N, E]] with Shrinkable[GraphParam[N, E]] with Cloneable[Graph[N, E]] with Mutable

Self Type
This[N, E]
Linear Supertypes
constrained.GraphLike[N, E, This], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], mutable.GraphLike[N, E, This], Mutable, EdgeOps[N, E, This], Cloneable[Graph[N, E]], Cloneable, Cloneable, Shrinkable[GraphParam[N, E]], Growable[GraphParam[N, E]], Clearable, GraphAux[N, E], collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, SetLike[GraphParam[N, E], This[N, E]], Subtractable[GraphParam[N, E], This[N, E]], GenSetLike[GraphParam[N, E], This[N, E]], (GraphParam[N, E]) ⇒ Boolean, IterableLike[GraphParam[N, E], This[N, E]], GenIterableLike[GraphParam[N, E], This[N, E]], TraversableLike[GraphParam[N, E], This[N, E]], GenTraversableLike[GraphParam[N, E], This[N, E]], Parallelizable[GraphParam[N, E], ParSet[GraphParam[N, E]]], TraversableOnce[GraphParam[N, E]], GenTraversableOnce[GraphParam[N, E]], FilterMonadic[GraphParam[N, E], This[N, E]], HasNewBuilder[GraphParam[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. GraphLike
  3. Constrained
  4. ConstraintHandlerMethods
  5. ConstraintMethods
  6. GraphLike
  7. Mutable
  8. EdgeOps
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Growable
  14. Clearable
  15. GraphAux
  16. GraphLike
  17. GraphDegree
  18. GraphTraversal
  19. GraphBase
  20. Serializable
  21. Serializable
  22. SetLike
  23. Subtractable
  24. GenSetLike
  25. Function1
  26. IterableLike
  27. GenIterableLike
  28. TraversableLike
  29. GenTraversableLike
  30. Parallelizable
  31. TraversableOnce
  32. GenTraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. Equals
  36. AnyRef
  37. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract type Config <: GraphConfig with GenConstrainedConfig

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

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

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

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

    Definition Classes
    GraphDegree
  6. trait Edge extends Serializable

    Definition Classes
    GraphBase
  7. class EdgeBase extends InnerEdge with InnerEdgeLike

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

    Definition Classes
    GraphBase
  9. trait EdgeSet extends Set[mutable.GraphLike.This.EdgeT] with mutable.GraphLike.This.EdgeSet with mutable.GraphLike.This.EdgeSetAux

    Definition Classes
    GraphLike → GraphLike → GraphBase
  10. trait EdgeSetAux extends GraphAux.EdgeSet

    Definition Classes
    GraphAux
  11. abstract type EdgeSetT <: This.EdgeSet

    Definition Classes
    GraphLike → GraphAux → GraphLike → GraphBase
  12. abstract type EdgeT <: This.InnerEdge with This.InnerEdgeLike with Serializable

    Definition Classes
    GraphBase
  13. sealed trait ElemOrdering extends AnyRef

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

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

    Definition Classes
    GraphDegree
  16. type InnerEdge = EdgeOut[N, E, This.NodeT, E]

    Attributes
    protected
    Definition Classes
    GraphBase
  17. trait InnerEdgeLike extends Iterable[GraphBase.NodeT] with Edge

    Definition Classes
    GraphBase
  18. trait InnerNodeLike extends mutable.GraphLike.This.InnerNodeLike with mutable.GraphLike.This.InnerNodeOps

    Definition Classes
    GraphLike → GraphLike → GraphTraversal → GraphBase
  19. trait InnerNodeOps extends AnyRef

    Definition Classes
    EdgeOps
  20. sealed class NoOrdering extends ElemOrdering

    Definition Classes
    GraphBase
  21. trait Node extends Serializable

    Definition Classes
    GraphBase
  22. abstract class NodeBase extends GraphLike.This.NodeBase with NodeOut[N] with GraphLike.This.InnerNodeLike

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

    Definition Classes
    GraphBase
  24. trait NodeSet extends This.NodeSet

    Definition Classes
    GraphLike → GraphLike → GraphLike → GraphBase
  25. trait NodeSetAux extends GraphAux.NodeSet

    Definition Classes
    GraphAux
  26. abstract type NodeSetT <: This.NodeSet

    Definition Classes
    GraphLike → GraphAux → GraphLike → GraphBase
  27. abstract type NodeT <: This.InnerNodeLike

    Definition Classes
    GraphLike → GraphLike → GraphTraversal → GraphBase
  28. trait Path extends Iterable[GraphParamOut[N, E]]

    Definition Classes
    GraphTraversal
  29. type Self = This[N, E]

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

    Attributes
    protected
    Definition Classes
    GraphLike
  31. abstract class Traversal extends AnyRef

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

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +=#(edge: E[N]): GraphLike.this.type

    Attributes
    protected
    Definition Classes
    GraphLike
  2. abstract def add(edge: E[N]): Boolean

    Definition Classes
    GraphLike
  3. abstract def add(node: N): Boolean

    Definition Classes
    GraphLike
  4. abstract def clear(): Unit

    Definition Classes
    Growable → Clearable
  5. implicit abstract def config: generic.GraphConstrainedCompanion.Config with This.Config

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

    Definition Classes
    GraphLike
  7. implicit abstract val edgeManifest: Manifest[E[N]]

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

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

    Definition Classes
    SetLike
  10. abstract 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
  11. abstract val graphCompanion: GraphConstrainedCompanion[This]

    Definition Classes
    GraphLike → GraphLike
  12. abstract def newEdge(innerEdge: E[This.NodeT]): This.EdgeT

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

    Attributes
    protected
    Definition Classes
    GraphBase
  14. 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
  15. abstract def nodes: This.NodeSetT

    Definition Classes
    GraphBase
  16. 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
  17. 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
  18. 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
  19. 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
  20. abstract val self: constrained.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
  21. abstract def seq: Set[GraphParam[N, E]]

    Definition Classes
    GenSetLike → Parallelizable → GenTraversableOnce

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[GraphParam[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  5. def &=(coll: Iterable[GraphParam[N, E]]): This[N, E]

    Definition Classes
    GraphLike
  6. def &~(that: GenSet[GraphParam[N, E]]): This[N, E]

    Definition Classes
    GenSetLike
  7. def +(node: N): This[N, E]

    Definition Classes
    GraphLike → GraphLike → GraphLike
  8. def +(elem: GraphParam[N, E]): This[N, E]

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

    Definition Classes
    SetLike
  10. final def +#(edge: E[N]): This[N, E]

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

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

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

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

    Definition Classes
    TraversableLike
  15. def ++=(elems: TraversableOnce[GraphParam[N, E]]): GraphLike.this.type

    Definition Classes
    GraphLike → GraphLike → Growable
  16. def +=(elem: GraphParam[N, E]): GraphLike.this.type

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

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

    Definition Classes
    Growable
  19. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  20. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  21. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  23. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  25. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E]): GraphLike.this.type

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. final def -?(node: N): This[N, E]

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

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

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

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

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

    Definition Classes
    Any
  51. object Edge extends Serializable

    Definition Classes
    GraphBase
  52. object Node extends Serializable

    Definition Classes
    GraphBase
  53. final def addAndGet(edge: E[N]): This.EdgeT

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

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

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

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  57. def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): This.EdgeT

    Definition Classes
    EdgeOps
  58. final def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): This.EdgeT

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

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

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

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

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

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

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  65. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. 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
  76. 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
  77. def andThen[A](g: (Boolean) ⇒ A): (GraphParam[N, E]) ⇒ A

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → Equals
  86. 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
    Definition Classes
    GraphLike
  87. def checkedAdd[G >: This[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Iterable[N], edges: ⇒ Iterable[E[N]]): This[N, E]

    generic checked addition

    generic checked addition

    Attributes
    protected
  88. def clone(): This[N, E]

    Definition Classes
    GraphLike → Cloneable → AnyRef
  89. def collect[B, That](pf: PartialFunction[GraphParam[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  110. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  119. final def findCycle: Option[This.Cycle]

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  126. def from(nodeStream: NodeInputStream[N], edgeStream: GenEdgeInputStream[N, E]): Unit

    Definition Classes
    GraphLike
  127. def from(nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]], edges: Iterable[E[N]]): Unit

    Attributes
    protected
    Definition Classes
    GraphAux
  128. final def get(outerEdge: E[N]): This.EdgeT

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

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

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

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

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

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

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

    Definition Classes
    IterableLike
  136. def hasDefiniteSize: Boolean

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

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

    Definition Classes
    GraphLike
  139. def head: GraphParam[N, E]

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

    Definition Classes
    TraversableLike → GenTraversableLike
  141. def init: This[N, E]

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

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

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

    Definition Classes
    GenSetLike
  145. final def isAcyclic: Boolean

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

    Definition Classes
    GraphTraversal
  147. def isConnected: Boolean

    Definition Classes
    GraphTraversal
  148. final def isCustomEdgeFilter(filter: (This.EdgeT) ⇒ Boolean): Boolean

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

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

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

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

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

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  154. def isEmpty: Boolean

    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  155. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  156. final def isTraversableAgain: Boolean

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

    Definition Classes
    GraphBase
    Annotations
    @inline()
  158. def iterator: Iterator[GraphParamOut[N, E] with Serializable]

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

    Definition Classes
    TraversableLike → GenTraversableLike
  160. def lastOption: Option[GraphParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike
  161. def map[B, That](f: (GraphParam[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.

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  170. def mkString: String

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  174. def newBuilder: Builder[GraphParam[N, E], This[N, E]]

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

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

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

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

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

    Definition Classes
    GraphBase
  180. final def nodesToEdgeCont(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*): This.EdgeT

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  182. final def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): This.EdgeT

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  183. final def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): This.EdgeT

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  184. final def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*): This.EdgeT

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  186. final def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*): This.EdgeT

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  188. def nonEmpty: Boolean

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

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

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

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

    This handler is called whenever an addition violates the constraints.

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

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

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

    Definition Classes
    ConstraintHandlerMethods
  193. def onSubtractionRefused(refusedNodes: Iterable[Graph.NodeT], refusedEdges: Iterable[Graph.EdgeT], graph: constrained.Graph[N, E]): Boolean

    This handler is called whenever a subtraction violates the constraints.

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

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

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

    Definition Classes
    ConstraintHandlerMethods
  194. def order: Int

    Definition Classes
    GraphBase
  195. def par: ParSet[GraphParam[N, E]]

    Definition Classes
    Parallelizable
  196. def parCombiner: Combiner[GraphParam[N, E], ParSet[GraphParam[N, E]]]

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  200. def postAdd(newGraph: constrained.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
  201. def postSubtract(newGraph: constrained.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
  202. def preAdd(elems: GraphParamIn[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
  203. 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
  204. 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
  205. def product[B >: GraphParam[N, E]](implicit num: Numeric[B]): B

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  212. final def remove(edge: E[N]): Boolean

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

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

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

    Definition Classes
    GraphLike
    Annotations
    @inline()
  216. def repr: This[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike
  217. def reversed: List[GraphParam[N, E]]

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  221. def scanRight[B, That](z: B)(op: (GraphParam[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.

  222. def size: Int

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  228. def stringPrefix: String

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  245. def toIterable: Iterable[GraphParam[N, E]]

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  249. def toSeq: Seq[GraphParam[N, E]]

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

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

    Definition Classes
    GraphLike
  252. def toStream: Stream[GraphParam[N, E]]

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

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

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

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

    Definition Classes
    GraphDegree
  257. def totalWeight: Long

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

    Definition Classes
    SetLike → GenSetLike
  259. def view(from: Int, until: Int): IterableView[GraphParam[N, E], This[N, E]]

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  266. def zip[A1 >: GraphParam[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That

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

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

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

    Definition Classes
    GenSetLike

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

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

Inherited from Mutable

Inherited from EdgeOps[N, E, This]

Inherited from Cloneable[Graph[N, E]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[GraphParam[N, E]]

Inherited from Growable[GraphParam[N, E]]

Inherited from Clearable

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

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

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

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

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

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

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

Inherited from GenTraversableLike[GraphParam[N, E], This[N, E]]

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

Inherited from TraversableOnce[GraphParam[N, E]]

Inherited from GenTraversableOnce[GraphParam[N, E]]

Inherited from FilterMonadic[GraphParam[N, E], This[N, E]]

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

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped