Packages

trait NodeSet extends Set[(GraphLike.this)#NodeT] with (GraphLike.this)#NodeSet

Linear Supertypes
(GraphLike.this)#NodeSet, (GraphLike.this)#NodeSet, ExtSetMethods[(GraphLike.this)#NodeT], FilterableSet[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT], SetOps[(GraphLike.this)#NodeT, Set, Set[(GraphLike.this)#NodeT]], Shrinkable[(GraphLike.this)#NodeT], Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Growable[(GraphLike.this)#NodeT], Clearable, Cloneable[Set[(GraphLike.this)#NodeT]], Cloneable, Set[(GraphLike.this)#NodeT], Equals, SetOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]], ((GraphLike.this)#NodeT) => Boolean, Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT], IterableFactoryDefaults[(GraphLike.this)#NodeT, [x]Set[x]], IterableOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]], IterableOnceOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]], scala.collection.IterableOnce[(GraphLike.this)#NodeT], AnyRef, Any
Known Subclasses
NodeSet
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSet
  2. NodeSet
  3. NodeSet
  4. ExtSetMethods
  5. FilterableSet
  6. Set
  7. SetOps
  8. Shrinkable
  9. Builder
  10. Growable
  11. Clearable
  12. Cloneable
  13. Cloneable
  14. Set
  15. Equals
  16. SetOps
  17. Function1
  18. Iterable
  19. Iterable
  20. IterableFactoryDefaults
  21. IterableOps
  22. IterableOnceOps
  23. IterableOnce
  24. AnyRef
  25. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by predicateToNodePredicate
  4. by TraversableEnrichments
  5. by anyToNode
  6. by ChainingOps
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def addOne(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    Growable
  2. abstract def contains(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetOps
  3. abstract def copy: (GraphLike.this)#NodeSetT
    Attributes
    protected
    Definition Classes
    NodeSet
  4. abstract def draw(random: Random): (GraphLike.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. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.

    random

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

    Definition Classes
    NodeSet → ExtSetMethods
  5. abstract def find(outerNode: N): Option[(GraphLike.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
    NodeSet
  6. abstract def findElem[B](toMatch: B, correspond: ((GraphLike.this)#NodeT, B) => Boolean): (GraphLike.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
    ExtSetMethods
  7. abstract def get(outerNode: N): (GraphLike.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
    NodeSet
  8. abstract def initialize(nodes: Iterable[N], edges: Iterable[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[collection]
    Definition Classes
    NodeSet
  9. abstract def iterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnce
  10. abstract def lookup(outerNode: N): (GraphLike.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
    NodeSet
  11. abstract def minus(node: (GraphLike.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
    NodeSet
  12. abstract def minusEdges(node: (GraphLike.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
  13. abstract def subtractOne(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    Shrinkable

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def ++(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  6. final def ++[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++=(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  8. final def +=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  9. final def -(node: (GraphLike.this)#NodeT): (GraphLike.this)#NodeSetT
    Definition Classes
    NodeSet → SetOps
  10. final def --=(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  11. final def -=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  12. def ->[B](y: B): ((GraphLike.this)#NodeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toArrowAssoc[(GraphLike.this)#NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. final def -?=(node: (GraphLike.this)#NodeT): NodeSet.this.type
    Annotations
    @inline()
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def add(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetOps
  16. def addAll(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Growable
  17. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  18. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  19. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  20. def adjacencyListsToString: String
    Definition Classes
    NodeSet
  21. def andThen[A](g: (Boolean) => A): ((GraphLike.this)#NodeT) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  22. final def apply(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  23. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  24. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.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
  25. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  26. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  27. def clear(): Unit
    Definition Classes
    NodeSet → Builder → Clearable
  28. def clone(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps → Cloneable → AnyRef
  29. final def coll: NodeSet.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  30. def collect[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  31. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Definition Classes
    IterableOnceOps
  32. def compose[A](g: (A) => (GraphLike.this)#NodeT): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  33. def concat(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
  34. def concat[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
  35. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  36. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  37. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  38. def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphLike.this)#NodeT, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  39. def count(p: ((GraphLike.this)#NodeT) => Boolean): Int
    Definition Classes
    IterableOnceOps
  40. def diff(that: AnySet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    NodeSet → NodeSet → SetOps → SetOps
  41. def drop(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def dropRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  43. def dropWhile(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  44. def empty: Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  45. def ensuring(cond: ((GraphLike.this)#NodeSet) => Boolean, msg: => Any): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEnsuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: ((GraphLike.this)#NodeSet) => Boolean): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEnsuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: Boolean, msg: => Any): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEnsuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: Boolean): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEnsuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(that: Any): Boolean
    Definition Classes
    Set → Equals → AnyRef → Any
  51. def exists(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  52. def filter(pred: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  53. def filterInPlace(p: ((GraphLike.this)#NodeT) => Boolean): NodeSet.this.type
    Definition Classes
    SetOps
  54. def filterNot(pred: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  56. def findElem(elem: (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Definition Classes
    ExtSetMethods
  57. def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def flatten[B](implicit asIterable: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  60. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
  61. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  62. def forall(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  63. def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
    Definition Classes
    IterableOnceOps
  64. def fromSpecific(coll: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  65. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  66. def groupBy[K](f: ((GraphLike.this)#NodeT) => K): Map[K, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  67. def groupMap[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B): Map[K, Set[B]]
    Definition Classes
    IterableOps
  68. def groupMapReduce[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  69. def grouped(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  70. def handleNotGentlyRemovable: Boolean
    Attributes
    protected
    Definition Classes
    NodeSet
  71. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  72. def head: (GraphLike.this)#NodeT
    Definition Classes
    IterableOps
  73. def headOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  74. def init: Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  75. def inits: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  76. def intersect(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
  77. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  78. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  79. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  80. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  81. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  82. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  83. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  84. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  85. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Set → Iterable → Iterable → IterableOps
  86. def knownSize: Int
    Definition Classes
    SetOps → Growable → IterableOnce
  87. def last: (GraphLike.this)#NodeT
    Definition Classes
    IterableOps
  88. def lastOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  89. def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphLike.this)#NodeT, B, NodeSet.this.type]
    Definition Classes
    Iterable
  90. def map[B](f: ((GraphLike.this)#NodeT) => B): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  91. def mapResult[NewTo](f: (Set[(GraphLike.this)#NodeT]) => NewTo): Builder[(GraphLike.this)#NodeT, NewTo]
    Definition Classes
    Builder
  92. def max[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  93. def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  94. def maxByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  95. def maxOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  96. def min[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  97. def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  98. def minByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  99. def minOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  100. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  101. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  102. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  103. val n1: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  104. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  105. def newSpecificBuilder: Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  106. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  107. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  108. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  109. def partition(p: ((GraphLike.this)#NodeT) => Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps
  110. def partitionMap[A1, A2](f: ((GraphLike.this)#NodeT) => Either[A1, A2]): (Set[A1], Set[A2])
    Definition Classes
    IterableOps
  111. def pipe[B](f: ((GraphLike.this)#NodeSet) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  112. def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  113. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  114. def reduce[B >: (GraphLike.this)#NodeT](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  115. def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
  116. def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): Option[B]
    Definition Classes
    IterableOnceOps
  117. def reduceOption[B >: (GraphLike.this)#NodeT](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  118. def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  119. def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  120. def remove(node: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    NodeSet → SetOps
  121. def removeGently(node: (GraphLike.this)#NodeT): Boolean
  122. def result(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps → Builder
  123. def reversed: Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  124. def scan[B >: (GraphLike.this)#NodeT](z: B)(op: (B, B) => B): Set[B]
    Definition Classes
    IterableOps
  125. def scanLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  126. def scanRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): Set[B]
    Definition Classes
    IterableOps
  127. val self: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  128. def size: Int
    Definition Classes
    IterableOnceOps
  129. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  130. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  131. final def sizeHint(coll: scala.collection.IterableOnce[_], delta: Int): Unit
    Definition Classes
    Builder
  132. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  133. final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
    Definition Classes
    Builder
  134. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  135. def slice(from: Int, until: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  136. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  137. def sliding(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  138. def span(p: ((GraphLike.this)#NodeT) => Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  139. def splitAt(n: Int): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  140. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphLike.this)#NodeT, S]): S
    Definition Classes
    IterableOnce
  141. def stringPrefix: String
    Definition Classes
    NodeSet → Set → Iterable
  142. def subsetOf(that: Set[(GraphLike.this)#NodeT]): Boolean
    Definition Classes
    SetOps
  143. def subsets(): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetOps
  144. def subsets(len: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetOps
  145. final def subtract(node: (GraphLike.this)#NodeT, rippleDelete: Boolean, minusNode: ((GraphLike.this)#NodeT) => Unit, minusEdges: ((GraphLike.this)#NodeT) => Unit): Boolean

    removes node either rippling or gently.

    removes node either rippling or gently.

    node

    the node to be subtracted

    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[collection]
    Definition Classes
    NodeSet
  146. def subtractAll(xs: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Shrinkable
  147. def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  148. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  149. val t: Set[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toTraversableEnrichments[(GraphLike.this)#NodeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  150. def tail: Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  151. def tails: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  152. def take(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  153. def takeRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  154. def takeWhile(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  155. def tap[U](f: ((GraphLike.this)#NodeSet) => U): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  156. def tapEach[U](f: ((GraphLike.this)#NodeT) => U): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  157. def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
    Definition Classes
    IterableOnceOps
  158. def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  159. final def toBuffer[B >: (GraphLike.this)#NodeT]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  160. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  161. def toList: List[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  162. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  163. 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
  164. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphLike.this)#NodeT, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toTraversableEnrichments[(GraphLike.this)#NodeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  165. def toSeq: Seq[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  166. def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
    Definition Classes
    IterableOnceOps
  167. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.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
  168. def toString(): String
    Definition Classes
    Set → Function1 → Iterable → AnyRef → Any
  169. def toVector: Vector[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  170. def transpose[B](implicit asIterable: ((GraphLike.this)#NodeT) => Iterable[B]): Set[Set[B]]
    Definition Classes
    IterableOps
  171. final def union(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  172. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) => (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    IterableOps
  173. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    IterableOps
  174. def update(elem: (GraphLike.this)#NodeT, included: Boolean): Unit
    Definition Classes
    SetOps
  175. val value: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  176. def view: View[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  177. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  178. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  179. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  180. def withFilter(p: ((GraphLike.this)#NodeT) => Boolean): WithFilter[(GraphLike.this)#NodeT, [_]Set[_]]
    Definition Classes
    IterableOps
  181. def withSetFilter(p: ((GraphLike.this)#NodeT) => Boolean): Set[(GraphLike.this)#NodeT] with FilterableSet[(GraphLike.this)#NodeT]
    Definition Classes
    FilterableSet
  182. def zip[B](that: scala.collection.IterableOnce[B]): Set[((GraphLike.this)#NodeT, B)]
    Definition Classes
    IterableOps
  183. def zipAll[A1 >: (GraphLike.this)#NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
    Definition Classes
    IterableOps
  184. def zipWithIndex: Set[((GraphLike.this)#NodeT, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  185. final def |(that: Set[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  186. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  187. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toEdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toany2stringadd[(GraphLike.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[(GraphLike.this)#NodeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) => A): (Param[(GraphLike.this)#NodeT, EI]) => A
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.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[(GraphLike.this)#NodeT, EI]) => Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[(GraphLike.this)#NodeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.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[(GraphLike.this)#NodeT, EI]) => Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) => Param[(GraphLike.this)#NodeT, EI]): (A) => Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.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[(GraphLike.this)#NodeT, EI]) => Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.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[(GraphLike.this)#NodeSet]).stringPrefix
    Definition Classes
    NodeParam
  6. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to(Param[(GraphLike.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[(GraphLike.this)#NodeT, EI]) => Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toOuterNode[(GraphLike.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[(GraphLike.this)#NodeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def +(elem: (GraphLike.this)#NodeT): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union

  3. def ++:[B >: (GraphLike.this)#NodeT](that: scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  4. final def +=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

  5. def -(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

  6. def --(that: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Set

  7. def -=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
    Definition Classes
    Shrinkable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.3) Use --= aka subtractAll instead of varargs -=; infix operations with an operand of multiple args will be deprecated

  8. def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  9. final def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  10. def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  11. final def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  12. def aggregate[B](z: => B)(seqop: (B, (GraphLike.this)#NodeT) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  13. def collectFirst[B](f: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  14. def companion: IterableFactory[[_]Set[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  15. def copyToBuffer(dest: Buffer[(GraphLike.this)#NodeT]): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  16. final def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  17. def count(f: ((GraphLike.this)#NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  18. def exists(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  19. def filter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  20. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  21. def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  22. def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  23. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  24. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  25. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  26. def forall(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  27. def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  28. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toStringFormat[(GraphLike.this)#NodeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  29. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  30. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  31. def map[B](f: ((GraphLike.this)#NodeT) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  32. def max(implicit ord: Ordering[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  33. def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  34. def min(implicit ord: Ordering[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  35. def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  36. def mkString: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  37. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  38. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  40. def product(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  41. def reduce(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  42. def reduceLeft(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  43. def reduceLeftOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  44. def reduceOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  45. def reduceRight(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  46. def reduceRightOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  47. final def repr: Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  48. final def retain(p: ((GraphLike.this)#NodeT) => Boolean): Unit
    Definition Classes
    SetOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use filterInPlace instead

  49. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  50. def seq: NodeSet.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  51. def size: Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  52. def sum(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  53. def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  54. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  55. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  56. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  57. final def toIterable: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  58. final def toIterable: NodeSet.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  59. def toIterator: Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  60. final def toIterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  61. def toList: List[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  62. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

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

    (Since version 1.8.0) Use toOuter instead

  64. def toSeq: Seq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  65. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  66. def toStream: Stream[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  67. final def toStream: Stream[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  68. final def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  69. final def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  70. def toVector: Vector[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  71. def view(from: Int, until: Int): View[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  72. def withFilter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  73. def →[B](y: B): ((GraphLike.this)#NodeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet toArrowAssoc[(GraphLike.this)#NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from (GraphLike.this)#NodeSet

Inherited from (GraphLike.this)#NodeSet

Inherited from ExtSetMethods[(GraphLike.this)#NodeT]

Inherited from FilterableSet[(GraphLike.this)#NodeT]

Inherited from Set[(GraphLike.this)#NodeT]

Inherited from SetOps[(GraphLike.this)#NodeT, Set, Set[(GraphLike.this)#NodeT]]

Inherited from Shrinkable[(GraphLike.this)#NodeT]

Inherited from Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Growable[(GraphLike.this)#NodeT]

Inherited from Clearable

Inherited from Cloneable[Set[(GraphLike.this)#NodeT]]

Inherited from Cloneable

Inherited from Set[(GraphLike.this)#NodeT]

Inherited from Equals

Inherited from SetOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]]

Inherited from ((GraphLike.this)#NodeT) => Boolean

Inherited from Iterable[(GraphLike.this)#NodeT]

Inherited from Iterable[(GraphLike.this)#NodeT]

Inherited from IterableFactoryDefaults[(GraphLike.this)#NodeT, [x]Set[x]]

Inherited from IterableOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]]

Inherited from IterableOnceOps[(GraphLike.this)#NodeT, [_]Set[_], Set[(GraphLike.this)#NodeT]]

Inherited from scala.collection.IterableOnce[(GraphLike.this)#NodeT]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods from(GraphLike.this)#NodeSet to IterableOnceExtensionMethods[(GraphLike.this)#NodeT]

Inherited by implicit conversion EdgeAssoc from(GraphLike.this)#NodeSet to EdgeAssoc[(GraphLike.this)#NodeSet]

Inherited by implicit conversion predicateToNodePredicate from(GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, EI]) => Boolean

Inherited by implicit conversion TraversableEnrichments from(GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT, Set]

Inherited by implicit conversion anyToNode from(GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet]

Inherited by implicit conversion ChainingOps from(GraphLike.this)#NodeSet to ChainingOps[(GraphLike.this)#NodeSet]

Inherited by implicit conversion any2stringadd from(GraphLike.this)#NodeSet to any2stringadd[(GraphLike.this)#NodeSet]

Inherited by implicit conversion StringFormat from(GraphLike.this)#NodeSet to StringFormat[(GraphLike.this)#NodeSet]

Inherited by implicit conversion Ensuring from(GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet]

Inherited by implicit conversion ArrowAssoc from(GraphLike.this)#NodeSet to ArrowAssoc[(GraphLike.this)#NodeSet]

Ungrouped