scalax.collection.constrained.mutable

DefaultGraphImpl

abstract class DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

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

Instance Constructors

  1. new DefaultGraphImpl(iniNodes: Iterable[N] = scala.collection.Set.apply[N](), iniEdges: Iterable[E[N]] = scala.collection.Set.apply[E[N]]())(implicit edgeManifest: Manifest[E[N]], _config: DefaultGraphImpl.Config with GenConstrainedConfig with AdjacencyListArrayConfig)

Type Members

  1. type Config = ConstrainedConfig

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

    Definition Classes
    GraphTraversal
  3. class CycleBuffer extends PathBuffer with GraphTraversalImpl.Cycle

    Definition Classes
    GraphTraversalImpl
  4. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

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

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

    Definition Classes
    GraphDegree
  7. trait Edge extends Serializable

    Definition Classes
    GraphBase
  8. class EdgeBase extends InnerEdge with InnerEdgeLike

    Definition Classes
    GraphBase
  9. class EdgeImpl extends mutable.AdjacencyListGraph.This.EdgeBase

    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID( 7972L )
  10. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering

    Definition Classes
    GraphBase
  11. class EdgeSet extends This.EdgeSet

    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
    Annotations
    @SerialVersionUID( 8084L )
  12. trait EdgeSetAux extends GraphAux.EdgeSet

    Definition Classes
    GraphAux
  13. type EdgeSetT = DefaultGraphImpl.EdgeSet

    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphAux → GraphLike → GraphBase
  14. type EdgeT = EdgeImpl

    Definition Classes
    AdjacencyListGraph → GraphBase
  15. sealed trait ElemOrdering extends AnyRef

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

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

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

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

    Definition Classes
    GraphBase
  20. abstract class InnerNodeImpl extends mutable.AdjacencyListGraph.This.NodeBase with mutable.AdjacencyListGraph.This.InnerNodeLike with mutable.AdjacencyListGraph.This.InnerNodeLike

    Definition Classes
    AdjacencyListGraph
  21. trait InnerNodeLike extends (AdjacencyListBase.this)#InnerNodeLike

    Definition Classes
    AdjacencyListBase → GraphLike → GraphTraversal → GraphBase
  22. trait InnerNodeOps extends AnyRef

    Definition Classes
    EdgeOps
  23. trait InnerNodeState extends AnyRef

    Definition Classes
    State
  24. trait InnerNodeTraversalImpl extends GraphTraversalImpl.InnerNodeLike with GraphTraversalImpl.InnerNodeState

    Definition Classes
    GraphTraversalImpl
  25. sealed class NoOrdering extends ElemOrdering

    Definition Classes
    GraphBase
  26. trait Node extends Serializable

    Definition Classes
    GraphBase
  27. class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → GraphLike → GraphBase
    Annotations
    @SerialVersionUID( 8082L )
  28. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering

    Definition Classes
    GraphBase
  29. class NodeSet extends DefaultGraphImpl.NodeSet with DefaultGraphImpl.NodeSet

    Definition Classes
    DefaultGraphImplAdjacencyListGraph → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphLike → GraphBase
  30. trait NodeSetAux extends GraphAux.NodeSet

    Definition Classes
    GraphAux
  31. type NodeSetT = DefaultGraphImpl.NodeSet

    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphAux → GraphLike → GraphBase
  32. type NodeT = NodeBase

    Definition Classes
    DefaultGraphImpl → GraphTraversalImpl → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  33. trait Path extends Iterable[GraphParamOut[N, E]]

    Definition Classes
    GraphTraversal
  34. class PathBuffer extends GraphTraversalImpl.Path

    Definition Classes
    GraphTraversalImpl
  35. type Self = DefaultGraphImpl[N, E]

    Attributes
    protected
    Definition Classes
    TraversableLike
  36. type ThisGraph = DefaultGraphImpl.this.type

    Attributes
    protected
    Definition Classes
    GraphLike
  37. class Traversal extends GraphTraversalImpl.Traversal

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  38. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract val constraintFactory: ConstraintCompanion[Constraint]

    Definition Classes
    GraphLike
  2. 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
  3. 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
  4. 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
  5. 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
  6. 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]]): DefaultGraphImpl[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Growable
  19. final def +=#(edge: E[N]): DefaultGraphImpl.this.type

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  20. 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]): DefaultGraphImpl.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  21. 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]): DefaultGraphImpl.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. 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]): DefaultGraphImpl.this.type

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

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. 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]): DefaultGraphImpl.this.type

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  25. 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]): DefaultGraphImpl.this.type

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  52. object Edge extends Serializable

    Definition Classes
    GraphBase
  53. object Node extends Serializable

    Definition Classes
    GraphBase
  54. final def add(edge: E[N]): Boolean

    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  55. final def add(node: N): Boolean

    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  56. final def addAndGet(edge: E[N]): EdgeT

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

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

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

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  60. 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
  61. 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()
  62. 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
  63. 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()
  64. 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
  65. 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()
  66. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E]): Boolean

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

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. 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()
  69. 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()
  70. def addString(b: StringBuilder): StringBuilder

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

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

    Definition Classes
    TraversableOnce
  73. 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()
  74. 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()
  75. 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()
  76. 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()
  77. def aggregate[B](z: B)(seqop: (B, GraphParam[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

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

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

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

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

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

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

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

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

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

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

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  91. final def clear(): Unit

    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  92. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit

    Attributes
    protected
    Definition Classes
    State
  93. final def clone(): DefaultGraphImpl.this.type

    Definition Classes
    DefaultGraphImpl → GraphLike → Cloneable → AnyRef
    Annotations
    @inline()
  94. def collect[B, That](pf: PartialFunction[GraphParam[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That

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

    Definition Classes
    TraversableOnce
  96. def companion: GenericCompanion[Set]

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  98. final def config: DefaultGraphImpl.Config with Config

    Definition Classes
    DefaultGraphImpl → GraphLike
  99. def contains(elem: GraphParam[N, E]): Boolean

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

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

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

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

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

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

    Definition Classes
    GraphBase
  106. final lazy val defaultNodeOrdering: NodeOrdering

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    State
  117. def dumpDirty: ExtBitSet

    Definition Classes
    State
  118. def dumpInUse: ExtBitSet

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

    Definition Classes
    AdjacencyListBase
  120. implicit val edgeManifest: Manifest[E[N]]

    Definition Classes
    DefaultGraphImpl → GraphLike
  121. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]

    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  122. final val edges: EdgeSet

    Definition Classes
    DefaultGraphImpl → AdjacencyListGraph → GraphBase
  123. final def empty: DefaultGraphImpl[N, E]

    Definition Classes
    DefaultGraphImplGraphGraph → Graph → Graph → SetLike → GenericSetTemplate
    Annotations
    @inline()
  124. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  133. def findCycle(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean, maxDepth: Int, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (EdgeT) ⇒ Unit, ordering: ElemOrdering): Option[Cycle]

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  134. final def findCycle: Option[Cycle]

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  142. final def from(that: AdjacencyListBase[N, E, DefaultGraphImpl])(delNodes: Iterable[immutable.AdjacencyListBase.NodeT], delEdges: Iterable[immutable.AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[N], addEdges: Iterable[E[N]]): Unit

    Attributes
    protected
    Definition Classes
    AdjacencyListBase
    Annotations
    @inline()
  143. def from(nodeStream: NodeInputStream[N], edgeStream: GenEdgeInputStream[N, E]): Unit

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

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

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

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

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

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

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

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

    Definition Classes
    DefaultGraphImplGraphLike → GraphLike
  152. def graphSize: Int

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

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

    Definition Classes
    IterableLike
  155. def hasDefiniteSize: Boolean

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  162. def inits: Iterator[DefaultGraphImpl[N, E]]

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

    Definition Classes
    GenSetLike
  164. final def isAcyclic: Boolean

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

    Definition Classes
    GraphTraversal
  166. def isConnected: Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  175. final def isTraversableAgain: Boolean

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  189. def mkString: String

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

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

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

    Definition Classes
    AnyRef
  193. def newBuilder: Builder[GraphParam[N, E], DefaultGraphImpl[N, E]]

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

    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  195. final def newEdgeTArray(size: Int): Array[EdgeT]

    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  196. final def newNode(n: N): NodeT

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

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

    Attributes
    protected
    Definition Classes
    DefaultGraphImpl → AdjacencyListBase
    Annotations
    @inline()
  199. def newTraversal(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (EdgeT) ⇒ Unit, ordering: ElemOrdering): Traversal

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  200. def nextHandle: Handle

    Attributes
    protected
    Definition Classes
    State
  201. final val noEdgeAction: (EdgeT) ⇒ Unit

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

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

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

    Definition Classes
    GraphTraversal
  205. final val noOrdering: NoOrdering

    Definition Classes
    GraphBase
  206. final val nodes: NodeSetT

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

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

    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  209. 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()
  210. 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()
  211. 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()
  212. 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()
  213. 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()
  214. 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()
  215. def nonEmpty: Boolean

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

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

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

    Definition Classes
    AnyRef
  219. 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
  220. 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
  221. def order: Int

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  227. 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
  228. 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
  229. 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
  230. 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
  231. 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
  232. def product[B >: GraphParam[N, E]](implicit num: Numeric[B]): B

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    State
  240. final def remove(edge: E[N]): Boolean

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  257. def stringPrefix: String

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

    Definition Classes
    GenSetLike
  259. def subsets: Iterator[DefaultGraphImpl[N, E]]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphDegree
  286. def totalWeight: Long

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

  288. def union(that: GenSet[GraphParam[N, E]]): DefaultGraphImpl[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Inherited from State[N, E]

Inherited from AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from mutable.AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from AdjacencyListBase[N, E, DefaultGraphImpl]

Inherited from Graph[N, E]

Inherited from GraphLike[N, E, DefaultGraphImpl]

Inherited from constrained.Graph[N, E]

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

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, DefaultGraphImpl]

Inherited from Mutable

Inherited from EdgeOps[N, E, DefaultGraphImpl]

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, DefaultGraphImpl]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[GraphParam[N, E]]

Inherited from Set[GraphParam[N, E]]

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

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

Inherited from GenSet[GraphParam[N, E]]

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

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

Inherited from Equals

Inherited from GenIterable[GraphParam[N, E]]

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped