scalax.collection.constrained

Graph

trait Graph[N, E[X] <: EdgeLikeIn[X]] extends Set[GraphParam[N, E]] with collection.Graph[N, E] with GraphLike[N, E, Graph]

A trait for dynamically constrained graphs.

N

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

E

the kind of the edges in this graph.

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

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

    Definition Classes
    GraphLike → GraphBase
  11. abstract type EdgeT <: InnerEdge with InnerEdgeLike with Serializable

    Definition Classes
    GraphBase
  12. sealed trait ElemOrdering extends AnyRef

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

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

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

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

    Definition Classes
    GraphBase
  17. trait InnerNodeLike extends GraphLike.This.InnerNodeLike

    Definition Classes
    GraphLike → GraphTraversal → GraphBase
  18. sealed class NoOrdering extends ElemOrdering

    Definition Classes
    GraphBase
  19. trait Node extends Serializable

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    TraversableLike
  27. type ThisGraph = Graph.this.type

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

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

    Definition Classes
    TraversableLike

Abstract Value Members

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

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

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

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

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

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

    Definition Classes
    GraphLike
  7. implicit abstract def config: generic.GraphConstrainedCompanion.Config with Config

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

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

    Definition Classes
    GraphLike
  10. abstract def edges: EdgeSetT

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

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

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

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

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

    Definition Classes
    GraphTraversal
  16. abstract def nodes: NodeSetT

    Definition Classes
    GraphBase
  17. 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
  18. 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
  19. abstract def preSubtract(edge: 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
  20. abstract def preSubtract(node: 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
  21. abstract val self: Graph[N, E]

    When extending Constraint, self will denote the attached constrained graph.

    When extending Constraint, self will denote the attached constrained graph. The factory methods of the companion object scalax.collection.constrained.Graph initialize self to the correct graph instance. When extending Constrained, self will denote this graph.

    Definition Classes
    ConstraintMethods

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 &~(that: GenSet[GraphParam[N, E]]): Graph[N, E]

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphLike
  17. def /:[B](z: B)(op: (B, GraphParam[N, E]) ⇒ B): B

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

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

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

    Definition Classes
    Any
  21. object Edge extends Serializable

    Definition Classes
    GraphBase
  22. object Node extends Serializable

    Definition Classes
    GraphBase
  23. def addString(b: StringBuilder): StringBuilder

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def allNodes(innerNodes: Set[NodeT], innerEdges: Set[EdgeT]): Set[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
  28. 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
  29. def andThen[A](g: (Boolean) ⇒ A): (GraphParam[N, E]) ⇒ A

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → Equals
  38. 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
  39. def clone(): AnyRef

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphBase
  51. final lazy val defaultNodeOrdering: NodeOrdering

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  80. def genericBuilder[B]: Builder[B, Set[B]]

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike
  89. def hasDefiniteSize: Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    GenSetLike
  98. final def isAcyclic: Boolean

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

    Definition Classes
    GraphTraversal
  100. def isConnected: Boolean

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  109. final def isTraversableAgain: Boolean

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  114. 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.

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  123. def mkString: String

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

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

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

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

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

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

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

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

    Definition Classes
    GraphTraversal
  132. final val noOrdering: NoOrdering

    Definition Classes
    GraphBase
  133. def nonEmpty: Boolean

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

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

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

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

    This handler is called whenever an addition violates the constraints.

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

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

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

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

    This handler is called whenever a subtraction violates the constraints.

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

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

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

    Definition Classes
    ConstraintHandlerMethods
  139. def order: Int

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  145. def postAdd(newGraph: Graph[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Boolean

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back.

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-addition would-be graph waiting for commit.

    passedNodes

    nodes passed to the running add operation except those coming from node/edge input streams.

    passedEdges

    edges passed to the running add operation except those coming from edge input streams.

    Definition Classes
    ConstraintMethods
  146. def postSubtract(newGraph: Graph[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Boolean

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back.

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-subtraction would-be graph waiting for commit.

    Definition Classes
    ConstraintMethods
  147. 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
  148. 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
  149. def preSubtract(nodes: ⇒ Set[NodeT], edges: ⇒ Set[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
  150. def product[B >: GraphParam[N, E]](implicit num: Numeric[B]): B

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def repr: Graph[N, E]

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

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

    Definition Classes
    IterableLike → GenIterableLike
  160. 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
  161. 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
  162. 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.

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  170. def stringPrefix: String

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GraphDegree
  199. def totalWeight: Long

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  211. 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
  212. 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
  213. def zipWithIndex[A1 >: GraphParam[N, E], That](implicit bf: CanBuildFrom[Graph[N, E], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  214. 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[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from collection.Graph[N, E]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[GraphParam[N, E]]

Inherited from Iterable[GraphParam[N, E]]

Inherited from Traversable[GraphParam[N, E]]

Inherited from Immutable

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 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 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 (GraphParam[N, E]) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

Ungrouped