scalax.collection.constrained.mutable

Graph

trait Graph[N, E[X] <: EdgeLikeIn[X]] extends mutable.Graph[N, E] with constrained.Graph[N, E] with GraphLike[N, E, Graph]

Linear Supertypes
GraphLike[N, E, Graph], constrained.Graph[N, E], constrained.GraphLike[N, E, Graph], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], mutable.Graph[N, E], mutable.GraphLike[N, E, Graph], Mutable, EdgeOps[N, E, Graph], Cloneable[Graph[N, E]], Cloneable, Cloneable, Shrinkable[GraphParam[N, E]], Growable[GraphParam[N, E]], Clearable, GraphAux[N, E], collection.Graph[N, E], collection.GraphLike[N, E, Graph], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, Set[GraphParam[N, E]], Set[GraphParam[N, E]], SetLike[GraphParam[N, E], Graph[N, E]], Subtractable[GraphParam[N, E], Graph[N, E]], GenSet[GraphParam[N, E]], GenericSetTemplate[GraphParam[N, E], Set], GenSetLike[GraphParam[N, E], Graph[N, E]], (GraphParam[N, E]) ⇒ Boolean, Iterable[GraphParam[N, E]], Iterable[GraphParam[N, E]], IterableLike[GraphParam[N, E], Graph[N, E]], Equals, GenIterable[GraphParam[N, E]], GenIterableLike[GraphParam[N, E], Graph[N, E]], Traversable[GraphParam[N, E]], Immutable, Traversable[GraphParam[N, E]], GenTraversable[GraphParam[N, E]], GenericTraversableTemplate[GraphParam[N, E], Set], TraversableLike[GraphParam[N, E], Graph[N, E]], GenTraversableLike[GraphParam[N, E], Graph[N, E]], Parallelizable[GraphParam[N, E], ParSet[GraphParam[N, E]]], TraversableOnce[GraphParam[N, E]], GenTraversableOnce[GraphParam[N, E]], FilterMonadic[GraphParam[N, E], Graph[N, E]], HasNewBuilder[GraphParam[N, E], Graph[N, E]], AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Graph
  2. GraphLike
  3. Graph
  4. GraphLike
  5. Constrained
  6. ConstraintHandlerMethods
  7. ConstraintMethods
  8. Graph
  9. GraphLike
  10. Mutable
  11. EdgeOps
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Shrinkable
  16. Growable
  17. Clearable
  18. GraphAux
  19. Graph
  20. GraphLike
  21. GraphDegree
  22. GraphTraversal
  23. GraphBase
  24. Serializable
  25. Serializable
  26. Set
  27. Set
  28. SetLike
  29. Subtractable
  30. GenSet
  31. GenericSetTemplate
  32. GenSetLike
  33. Function1
  34. Iterable
  35. Iterable
  36. IterableLike
  37. Equals
  38. GenIterable
  39. GenIterableLike
  40. Traversable
  41. Immutable
  42. Traversable
  43. GenTraversable
  44. GenericTraversableTemplate
  45. TraversableLike
  46. GenTraversableLike
  47. Parallelizable
  48. TraversableOnce
  49. GenTraversableOnce
  50. FilterMonadic
  51. HasNewBuilder
  52. AnyRef
  53. 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, 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 <: EdgeSet

    Definition Classes
    GraphLike → GraphAux → GraphLike → GraphBase
  12. abstract type EdgeT <: InnerEdge with 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, 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 <: Graph.NodeSet

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

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

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

    Attributes
    protected
    Definition Classes
    TraversableLike
  30. type ThisGraph = Graph.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]): Graph.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 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: EdgeSetT

    Definition Classes
    GraphBase
  9. abstract def findCycle(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean, maxDepth: Int, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (EdgeT) ⇒ Unit, ordering: ElemOrdering): Option[Cycle]

    Definition Classes
    GraphTraversal
  10. abstract val graphCompanion: GraphConstrainedCompanion[Graph]

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

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

    Attributes
    protected
    Definition Classes
    GraphBase
  13. abstract def newTraversal(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (EdgeT) ⇒ Unit, ordering: ElemOrdering): Traversal

    Definition Classes
    GraphTraversal
  14. abstract def nodes: NodeSetT

    Definition Classes
    GraphBase
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphLike
    Annotations
    @inline()
  18. def +=(elem1: GraphParam[N, E], elem2: GraphParam[N, E], elems: GraphParam[N, E]*): Graph.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]): Graph.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]): Graph.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]): Graph.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]): Graph.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]): Graph.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]): Graph.this.type

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  46. final def -?=(node: N): Graph.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]): EdgeT

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

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

    Definition Classes
    EdgeOps
  56. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): 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]): 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]): 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]): 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]): 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]): 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]): 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: (EdgeT) ⇒ Boolean

    Definition Classes
    GraphTraversal
  79. final val anyNode: (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: NodeOrdering, ordEdge: EdgeOrdering): String

    Definition Classes
    GraphLike
  84. final def bulkOp(elems: GenTraversableOnce[GraphParam[N, E]], isPlusPlus: Boolean): Graph[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 >: Graph[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Iterable[N], edges: ⇒ Iterable[E[N]]): Graph[N, E]

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  88. def clone(): Graph[N, E]

    Definition Classes
    GraphLike → Cloneable → AnyRef
  89. def collect[B, That](pf: PartialFunction[GraphParam[N, E], B])(implicit bf: CanBuildFrom[Graph[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 companion: GenericCompanion[Set]

    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  92. def compose[A](g: (A) ⇒ GraphParam[N, E]): (A) ⇒ Boolean

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

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

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

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

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

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

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

    Definition Classes
    GraphBase
  100. final lazy val defaultNodeOrdering: NodeOrdering

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  111. def empty: Graph[N, E]

    Definition Classes
    GraphGraph → Graph → Graph → SetLike → GenericSetTemplate
  112. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  123. def flatten[B](implicit asTraversable: (GraphParam[N, E]) ⇒ GenTraversableOnce[B]): Set[B]

    Definition Classes
    GenericTraversableTemplate
  124. def fold[A1 >: GraphParam[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphAux
  131. def genericBuilder[B]: Builder[B, Set[B]]

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike
  140. def hasDefiniteSize: Boolean

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  145. def init: Graph[N, E]

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

    Attributes
    protected
    Definition Classes
    GraphBase
  147. def inits: Iterator[Graph[N, E]]

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

    Definition Classes
    GenSetLike
  149. final def isAcyclic: Boolean

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

    Definition Classes
    GraphTraversal
  151. def isConnected: Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  160. final def isTraversableAgain: Boolean

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  165. def map[B, That](f: (GraphParam[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That

    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  174. def mkString: String

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

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

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

    Definition Classes
    AnyRef
  178. def newBuilder: Builder[GraphParam[N, E], Graph[N, E]]

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

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

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

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

    Definition Classes
    GraphTraversal
  183. final val noOrdering: NoOrdering

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

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  186. 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*): EdgeT

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  187. 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): EdgeT

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  188. 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*): EdgeT

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  190. 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*): EdgeT

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  191. 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): EdgeT

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

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

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

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

    Definition Classes
    AnyRef
  196. 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
  197. 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
  198. def order: Int

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  226. def seq: Set[GraphParam[N, E]]

    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  227. def size: Int

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  233. def stringPrefix: String

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

    Definition Classes
    GenSetLike
  235. def subsets: Iterator[Graph[N, E]]

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

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

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

    Definition Classes
    AnyRef
  239. def tail: Graph[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike
  240. def tails: Iterator[Graph[N, E]]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphDegree
  262. def totalWeight: Long

    Definition Classes
    GraphBase
  263. def transpose[B](implicit asTraversable: (GraphParam[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  264. def union(that: GenSet[GraphParam[N, E]]): Graph[N, E]

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

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

    Definition Classes
    GenericTraversableTemplate
  267. def view(from: Int, until: Int): IterableView[GraphParam[N, E], Graph[N, E]]

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

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → GenIterableLike
  277. def |(that: GenSet[GraphParam[N, E]]): Graph[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 GraphLike[N, E, Graph]

Inherited from constrained.Graph[N, E]

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

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from mutable.Graph[N, E]

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

Inherited from Mutable

Inherited from EdgeOps[N, E, Graph]

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

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[GraphParam[N, E]]

Inherited from Set[GraphParam[N, E]]

Inherited from SetLike[GraphParam[N, E], Graph[N, E]]

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

Inherited from GenSet[GraphParam[N, E]]

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

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

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

Inherited from Iterable[GraphParam[N, E]]

Inherited from Iterable[GraphParam[N, E]]

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

Inherited from Equals

Inherited from GenIterable[GraphParam[N, E]]

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

Inherited from Traversable[GraphParam[N, E]]

Inherited from Immutable

Inherited from Traversable[GraphParam[N, E]]

Inherited from GenTraversable[GraphParam[N, E]]

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped