Packages

class NodeSet extends This.NodeSet with This.NodeSet

Linear Supertypes
This.NodeSet, This.NodeSet, This.NodeSet, This.NodeSet, ExtSetMethods[This.NodeT], Set[This.NodeT], SetLike[This.NodeT, Set[This.NodeT]], Cloneable[Set[This.NodeT]], Cloneable, Cloneable, Shrinkable[This.NodeT], Builder[This.NodeT, Set[This.NodeT]], Growable[This.NodeT], Clearable, Scriptable[This.NodeT], Set[This.NodeT], SetLike[This.NodeT, Set[This.NodeT]], Subtractable[This.NodeT, Set[This.NodeT]], GenSet[This.NodeT], GenericSetTemplate[This.NodeT, Set], GenSetLike[This.NodeT, Set[This.NodeT]], (This.NodeT) ⇒ Boolean, Iterable[This.NodeT], Iterable[This.NodeT], IterableLike[This.NodeT, Set[This.NodeT]], Equals, GenIterable[This.NodeT], GenIterableLike[This.NodeT, Set[This.NodeT]], Traversable[This.NodeT], Mutable, Traversable[This.NodeT], GenTraversable[This.NodeT], GenericTraversableTemplate[This.NodeT, Set], TraversableLike[This.NodeT, Set[This.NodeT]], GenTraversableLike[This.NodeT, Set[This.NodeT]], Parallelizable[This.NodeT, ParSet[This.NodeT]], TraversableOnce[This.NodeT], GenTraversableOnce[This.NodeT], FilterMonadic[This.NodeT, Set[This.NodeT]], HasNewBuilder[This.NodeT, Set[This.NodeT]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSet
  2. NodeSet
  3. NodeSet
  4. NodeSet
  5. NodeSet
  6. ExtSetMethods
  7. Set
  8. SetLike
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Builder
  14. Growable
  15. Clearable
  16. Scriptable
  17. Set
  18. SetLike
  19. Subtractable
  20. GenSet
  21. GenericSetTemplate
  22. GenSetLike
  23. Function1
  24. Iterable
  25. Iterable
  26. IterableLike
  27. Equals
  28. GenIterable
  29. GenIterableLike
  30. Traversable
  31. Mutable
  32. Traversable
  33. GenTraversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. GenTraversableLike
  37. Parallelizable
  38. TraversableOnce
  39. GenTraversableOnce
  40. FilterMonadic
  41. HasNewBuilder
  42. AnyRef
  43. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by graphParamsToPartition
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeSet()

Type Members

  1. type Self = Set[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    GenSetLike
  5. def +(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  6. def +(elem: This.NodeT): Set[This.NodeT]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def ++(xs: GenTraversableOnce[This.NodeT]): Set[This.NodeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

  8. def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[This.NodeT]): NodeSet.this.type
    Definition Classes
    Growable
  12. def +=(edge: This.EdgeT): NodeSet.this.type
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSetNodeSet
  13. final def +=(node: This.NodeT): NodeSet.this.type
    Definition Classes
    NodeSet → SetLike → Builder → Growable
    Annotations
    @inline()
  14. def +=(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): NodeSet.this.type
    Definition Classes
    Growable
  15. final def -(node: This.NodeT): This.NodeSetT
    Definition Classes
    NodeSet → SetLike → Subtractable → GenSetLike
  16. def -(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  17. def --(xs: GenTraversableOnce[This.NodeT]): Set[This.NodeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

  18. def --=(xs: TraversableOnce[This.NodeT]): NodeSet.this.type
    Definition Classes
    Shrinkable
  19. def -=(edge: This.EdgeT): NodeSet.this.type
    Attributes
    protected[scalax.collection]
  20. final def -=(node: This.NodeT): NodeSet.this.type
    Definition Classes
    NodeSet → SetLike → Shrinkable
    Annotations
    @inline()
  21. def -=(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): NodeSet.this.type
    Definition Classes
    Shrinkable
  22. def ->[B](y: B): (This.NodeSet, B)
    Implicit
    This member is added by an implicit conversion from This.NodeSet to ArrowAssoc[This.NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  23. final def -?(node: This.NodeT): This.NodeSetT
    Definition Classes
    NodeSet
    Annotations
    @inline()
  24. final def -?=(node: This.NodeT): NodeSet.this.type
    Definition Classes
    NodeSet
    Annotations
    @inline()
  25. def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  28. def add(edge: This.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
  29. def add(node: This.NodeT): Boolean
    Definition Classes
    NodeSet → SetLike
  30. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  31. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  32. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  33. def adjacencyListsToString: String
    Definition Classes
    NodeSet
  34. def aggregate[B](z: ⇒ B)(seqop: (B, This.NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def andThen[A](g: (Boolean) ⇒ A): (This.NodeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. def apply(elem: This.NodeT): Boolean
    Definition Classes
    GenSetLike → Function1
  37. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  38. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.NodeOrdering = defaultNodeOrdering): String

    Sorts all nodes according to ord and concatenates them using separator.

    Sorts all nodes according to ord and concatenates them using separator.

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

    sorted and concatenated string representation of this node set.

    Definition Classes
    NodeSet
  39. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  40. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  41. def clone(): Set[This.NodeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  42. val coll: ExtHashSet[This.NodeT]
    Attributes
    protected
    Definition Classes
    NodeSet
  43. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  45. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  46. def compose[A](g: (A) ⇒ This.NodeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  47. final def contains(node: This.NodeT): Boolean
    Definition Classes
    NodeSet → SetLike → GenSetLike
    Annotations
    @inline()
  48. def copy: This.NodeSetT
    Attributes
    protected
    Definition Classes
    NodeSetNodeSet
  49. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def copyToArray[B >: This.NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  53. def count(p: (This.NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def diff(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    SetLike → GenSetLike
  55. final def draw(random: Random): This.NodeT

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    random

    a random generator; it is essential that random be instantiated by the caller just once for any sequence of calls

    Definition Classes
    NodeSetNodeSetExtSetMethods
    Annotations
    @inline()
  56. def drop(n: Int): Set[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  57. def dropRight(n: Int): Set[This.NodeT]
    Definition Classes
    IterableLike
  58. def dropWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  60. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  61. def empty: Set[This.NodeT]
    Definition Classes
    GenericSetTemplate
  62. def ensuring(cond: (This.NodeSet) ⇒ Boolean, msg: ⇒ Any): This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Ensuring[This.NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  63. def ensuring(cond: (This.NodeSet) ⇒ Boolean): This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Ensuring[This.NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  64. def ensuring(cond: Boolean, msg: ⇒ Any): This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Ensuring[This.NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  65. def ensuring(cond: Boolean): This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Ensuring[This.NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  66. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  67. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  68. def exists(p: (This.NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. def filter(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def filterNot(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  72. final def find(elem: N): Option[This.NodeT]

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node wrapped by Some if found, otherwise None.

    Definition Classes
    NodeSetNodeSet
    Annotations
    @inline()
  73. def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  74. final def findEntry[B](toMatch: B, correspond: (This.NodeT, B) ⇒ Boolean): This.NodeT

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    toMatch

    a value not necessarily of type A; the entry to be searched for must have the same hashCode and be equal to this argument

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    NodeSetExtSetMethods
    Annotations
    @inline()
  75. def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  76. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  77. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  80. def forall(p: (This.NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  81. def foreach[U](f: (This.NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  82. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from This.NodeSet to StringFormat[This.NodeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  83. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  84. final def get(outer: N): This.NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise NoSuchElementException is thrown.

    Definition Classes
    NodeSetNodeSet
  85. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  86. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Set[This.NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def grouped(size: Int): Iterator[Set[This.NodeT]]
    Definition Classes
    IterableLike
  88. def handleNotGentlyRemovable: Boolean
    Attributes
    protected
    Definition Classes
    NodeSet
  89. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  90. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  91. def head: This.NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  92. def headOption: Option[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  93. def init: Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit

    This method is called by the primary constructor.

    This method is called by the primary constructor. It must be defined by the trait responsible for the implementation of the graph representation.

    nodes

    The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.

    edges

    The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSetNodeSet
  95. def inits: Iterator[Set[This.NodeT]]
    Definition Classes
    TraversableLike
  96. def intersect(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    GenSetLike
  97. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  98. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  99. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  100. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  101. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  102. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  103. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  104. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  105. final def iterator: Iterator[This.NodeT]
    Definition Classes
    NodeSet → GenSetLike → IterableLike → GenIterableLike
    Annotations
    @inline()
  106. def last: This.NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def lastOption: Option[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. final def lookup(elem: N): This.NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise null.

    Definition Classes
    NodeSetNodeSet
  109. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], 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.

  110. def mapResult[NewTo](f: (Set[This.NodeT]) ⇒ NewTo): Builder[This.NodeT, NewTo]
    Definition Classes
    Builder
  111. def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def maxBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def minBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def minus(node: This.NodeT): Unit

    removes node from this node set leaving the edge set unchanged.

    removes node from this node set leaving the edge set unchanged.

    node

    the node to be removed from the node set.

    Attributes
    protected
    Definition Classes
    NodeSetNodeSet
  116. def minusEdges(node: This.NodeT): Unit

    removes all incident edges of node from the edge set leaving the node set unchanged.

    removes all incident edges of node from the edge set leaving the node set unchanged.

    node

    the node the incident edges of which are to be removed from the edge set.

    Attributes
    protected
    Definition Classes
    NodeSetNodeSet
  117. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. val n1: This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to EdgeAssoc[This.NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  121. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  122. def newBuilder: Builder[This.NodeT, Set[This.NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  123. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  124. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. final def notify(): Unit
    Definition Classes
    AnyRef
  126. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  127. def par: ParSet[This.NodeT]
    Definition Classes
    Parallelizable
  128. def parCombiner: Combiner[This.NodeT, ParSet[This.NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  129. def partition(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  130. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  131. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  134. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  137. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def remove(edge: This.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
  139. def remove(node: This.NodeT): Boolean
    Definition Classes
    NodeSet → SetLike
  140. def removeGently(node: This.NodeT): Boolean
    Definition Classes
    NodeSet
  141. def repr: Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def result(): Set[This.NodeT]
    Definition Classes
    SetLike → Builder
  143. def retain(p: (This.NodeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  144. def reversed: List[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  145. def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  146. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], 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.

  149. def seq: Set[This.NodeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  150. final def size: Int
    Definition Classes
    NodeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  151. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  152. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  153. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  154. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  155. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  156. def slice(from: Int, until: Int): Set[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  157. def sliding(size: Int, step: Int): Iterator[Set[This.NodeT]]
    Definition Classes
    IterableLike
  158. def sliding(size: Int): Iterator[Set[This.NodeT]]
    Definition Classes
    IterableLike
  159. def span(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def splitAt(n: Int): (Set[This.NodeT], Set[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def stringPrefix: String
    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike
  162. def subsetOf(that: GenSet[This.NodeT]): Boolean
    Definition Classes
    GenSetLike
  163. def subsets(): Iterator[Set[This.NodeT]]
    Definition Classes
    SetLike
  164. def subsets(len: Int): Iterator[Set[This.NodeT]]
    Definition Classes
    SetLike
  165. final def subtract(node: This.NodeT, rippleDelete: Boolean, minusNode: (This.NodeT) ⇒ Unit, minusEdges: (This.NodeT) ⇒ Unit): Boolean

    removes node either rippling or gently.

    removes node either rippling or gently.

    rippleDelete

    if true, node will be deleted with its incident edges; otherwise node will be only deleted if it has no incident edges or all its incident edges are hooks.

    minusNode

    implementation of node removal without considering incident edges.

    minusEdges

    implementation of removal of all incident edges.

    returns

    true if node has been removed.

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  166. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  168. def tail: Set[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  169. def tails: Iterator[Set[This.NodeT]]
    Definition Classes
    TraversableLike
  170. def take(n: Int): Set[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  171. def takeRight(n: Int): Set[This.NodeT]
    Definition Classes
    IterableLike
  172. def takeWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  173. def thisCollection: Iterable[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  174. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  175. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def toBuffer[A1 >: This.NodeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  177. def toCollection(repr: Set[This.NodeT]): Iterable[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  178. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  179. def toIndexedSeq: IndexedSeq[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def toIterable: Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  181. def toIterator: Iterator[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  182. def toList: List[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toOuter: Set[N]

    Converts this node set to a set of outer nodes.

    Converts this node set to a set of outer nodes.

    Definition Classes
    NodeSet
  185. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  186. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  187. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to CollectionsHaveToParArray[This.NodeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.NodeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  188. def toSeq: Seq[This.NodeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  189. def toSet[B >: This.NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.NodeOrdering = defaultNodeOrdering): String

    Sorts all nodes according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    Sorts all nodes according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

    sorted, concatenated and prefixed string representation of this node set.

    Definition Classes
    NodeSet
  191. def toStream: Stream[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  192. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  193. def toTraversable: Traversable[This.NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  194. def toVector: Vector[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  195. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ 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.

  196. def union(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    SetLike → GenSetLike
  197. def unzip[A1, A2](implicit asPair: (This.NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  198. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  199. def update(elem: This.NodeT, included: Boolean): Unit
    Definition Classes
    SetLike
  200. def upsert(edge: This.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
  201. val value: This.NodeSet
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  202. def view(from: Int, until: Int): IterableView[This.NodeT, Set[This.NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  203. def view: IterableView[This.NodeT, Set[This.NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  204. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  205. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  206. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  207. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Set[This.NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  208. def withSetFilter(p: (This.NodeT) ⇒ Boolean): FilteredSet[This.NodeT]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  209. def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  210. def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[This.NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  211. def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Set[This.NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  212. def |(that: GenSet[This.NodeT]): Set[This.NodeT]
    Definition Classes
    GenSetLike
  213. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to EdgeAssoc[This.NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  214. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to EdgeAssoc[This.NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  215. def [B](y: B): (This.NodeSet, B)
    Implicit
    This member is added by an implicit conversion from This.NodeSet to ArrowAssoc[This.NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from This.NodeSet to any2stringadd[This.NodeSet] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: any2stringadd[This.NodeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[This.NodeT, EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from This.NodeSet to (Param[This.NodeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[This.NodeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to (Param[This.NodeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[This.NodeT, EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from This.NodeSet to (Param[This.NodeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (This.NodeT) ⇒ Boolean): TraversableOnce[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[This.NodeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (This.NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[This.NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: (This.NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[This.NodeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: OuterNode[This.NodeSet]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.NodeSet to OuterNode[This.NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: OuterNode[This.NodeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.NodeSet to (Param[This.NodeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: (Param[This.NodeT, EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  12. def withFilter(p: (This.NodeT) ⇒ Boolean): Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.NodeSet to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[This.NodeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def <<(cmd: Message[This.NodeT]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

  2. def toNodeInSet: Set[N]
    Definition Classes
    NodeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from ExtSetMethods[This.NodeT]

Inherited from Set[This.NodeT]

Inherited from SetLike[This.NodeT, Set[This.NodeT]]

Inherited from Cloneable[Set[This.NodeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[This.NodeT]

Inherited from Builder[This.NodeT, Set[This.NodeT]]

Inherited from Growable[This.NodeT]

Inherited from Clearable

Inherited from Scriptable[This.NodeT]

Inherited from Set[This.NodeT]

Inherited from SetLike[This.NodeT, Set[This.NodeT]]

Inherited from Subtractable[This.NodeT, Set[This.NodeT]]

Inherited from GenSet[This.NodeT]

Inherited from GenericSetTemplate[This.NodeT, Set]

Inherited from GenSetLike[This.NodeT, Set[This.NodeT]]

Inherited from (This.NodeT) ⇒ Boolean

Inherited from Iterable[This.NodeT]

Inherited from Iterable[This.NodeT]

Inherited from IterableLike[This.NodeT, Set[This.NodeT]]

Inherited from Equals

Inherited from GenIterable[This.NodeT]

Inherited from GenIterableLike[This.NodeT, Set[This.NodeT]]

Inherited from Traversable[This.NodeT]

Inherited from Mutable

Inherited from Traversable[This.NodeT]

Inherited from GenTraversable[This.NodeT]

Inherited from GenericTraversableTemplate[This.NodeT, Set]

Inherited from TraversableLike[This.NodeT, Set[This.NodeT]]

Inherited from GenTraversableLike[This.NodeT, Set[This.NodeT]]

Inherited from Parallelizable[This.NodeT, ParSet[This.NodeT]]

Inherited from TraversableOnce[This.NodeT]

Inherited from GenTraversableOnce[This.NodeT]

Inherited from FilterMonadic[This.NodeT, Set[This.NodeT]]

Inherited from HasNewBuilder[This.NodeT, Set[This.NodeT]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.NodeSet to OuterNode[This.NodeSet]

Inherited by implicit conversion CollectionsHaveToParArray from This.NodeSet to CollectionsHaveToParArray[This.NodeSet, T]

Inherited by implicit conversion MonadOps from This.NodeSet to MonadOps[This.NodeT]

Inherited by implicit conversion flattenTraversableOnce from This.NodeSet to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from This.NodeSet to EdgeAssoc[This.NodeSet]

Inherited by implicit conversion predicateToNodePredicate from This.NodeSet to (Param[This.NodeT, EI]) ⇒ Boolean

Inherited by implicit conversion graphParamsToPartition from This.NodeSet to Partitions[N, E]

Inherited by implicit conversion any2stringadd from This.NodeSet to any2stringadd[This.NodeSet]

Inherited by implicit conversion StringFormat from This.NodeSet to StringFormat[This.NodeSet]

Inherited by implicit conversion Ensuring from This.NodeSet to Ensuring[This.NodeSet]

Inherited by implicit conversion ArrowAssoc from This.NodeSet to ArrowAssoc[This.NodeSet]

Inherited by implicit conversion alternateImplicit from This.NodeSet to ForceImplicitAmbiguity

Ungrouped