Packages

trait EdgeSet extends Set[(GraphLike.this)#EdgeT] with (GraphLike.this)#EdgeSet with AddSubtract[(GraphLike.this)#EdgeT, (GraphLike.this)#EdgeSet]

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

Abstract Value Members

  1. abstract def contains(node: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    EdgeSet
  2. abstract def contains(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetOps
  3. abstract def find(outerEdge: E[N]): Option[(GraphLike.this)#EdgeT]

    Finds the inner edge corresponding to outerEdge.

    Finds the inner edge corresponding to outerEdge.

    returns

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

    Definition Classes
    EdgeSet
  4. abstract def hasAnyHyperEdge: Boolean
    Definition Classes
    EdgeSet
  5. abstract def hasAnyMultiEdge: Boolean
    Definition Classes
    EdgeSet
  6. abstract def hasMixedEdges: Boolean
    Definition Classes
    EdgeSet
  7. abstract def hasOnlyDiEdges: Boolean
    Definition Classes
    EdgeSet
  8. abstract def hasOnlyUnDiEdges: Boolean
    Definition Classes
    EdgeSet
  9. abstract def initialize(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.

    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
    EdgeSet
  10. abstract def iterator: Iterator[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnce
  11. abstract def removeWithNodes(edge: (GraphLike.this)#EdgeT): Boolean
  12. abstract def upsert(edge: (GraphLike.this)#EdgeT): Boolean

    Same as upsert at graph level.

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)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: Set[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def ++(that: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  6. final def ++[B >: (GraphLike.this)#EdgeT](suffix: scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++=(xs: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  8. final def +=(elem: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  9. final def --=(xs: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  10. final def -=(elem: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  11. def ->[B](y: B): ((GraphLike.this)#EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toArrowAssoc[(GraphLike.this)#EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def add(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetOps
  14. def addAll(xs: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Growable
  15. final def addOne(edge: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → Growable
    Annotations
    @inline()
  16. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  17. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  19. def andThen[A](g: (Boolean) => A): ((GraphLike.this)#EdgeT) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  20. final def apply(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  21. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  22. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.this)#EdgeOrdering = defaultEdgeOrdering): String

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

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

    separator

    to separate edges by.

    ord

    custom ordering.

    returns

    sorted and concatenated string representation of this edge set.

    Definition Classes
    EdgeSet
  23. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  24. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  25. def clear(): Unit
    Definition Classes
    EdgeSet → Builder → Clearable
  26. def clone(): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps → Cloneable → AnyRef
  27. final def coll: EdgeSet.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  28. def collect[B](pf: PartialFunction[(GraphLike.this)#EdgeT, B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  29. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#EdgeT, B]): Option[B]
    Definition Classes
    IterableOnceOps
  30. def compose[A](g: (A) => (GraphLike.this)#EdgeT): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def concat(that: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
  32. def concat[B >: (GraphLike.this)#EdgeT](suffix: scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
  33. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  34. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  35. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  36. def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphLike.this)#EdgeT, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def count(p: ((GraphLike.this)#EdgeT) => Boolean): Int
    Definition Classes
    IterableOnceOps
  38. def diff(that: AnySet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    EdgeSet → EdgeSet → SetOps → SetOps
  39. final def draw(random: Random): (GraphLike.this)#EdgeT

    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
    EdgeSet → ExtSetMethods
  40. def drop(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  41. def dropRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  42. def dropWhile(p: ((GraphLike.this)#EdgeT) => Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  43. def empty: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  44. def ensuring(cond: ((GraphLike.this)#EdgeSet) => Boolean, msg: => Any): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEnsuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: ((GraphLike.this)#EdgeSet) => Boolean): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEnsuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean, msg: => Any): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEnsuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: Boolean): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEnsuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  49. def equals(that: Any): Boolean
    Definition Classes
    Set → Equals → AnyRef → Any
  50. def exists(p: ((GraphLike.this)#EdgeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  51. def filter(pred: ((GraphLike.this)#EdgeT) => Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  52. def filterInPlace(p: ((GraphLike.this)#EdgeT) => Boolean): EdgeSet.this.type
    Definition Classes
    SetOps
  53. def filterNot(pred: ((GraphLike.this)#EdgeT) => Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  54. def find(p: ((GraphLike.this)#EdgeT) => Boolean): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  55. final def findElem[B](other: B, correspond: ((GraphLike.this)#EdgeT, B) => Boolean): (GraphLike.this)#EdgeT

    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.

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    EdgeSet → ExtSetMethods
  56. def findElem(elem: (GraphLike.this)#EdgeT): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    ExtSetMethods
  57. def flatMap[B](f: ((GraphLike.this)#EdgeT) => scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def flatten[B](implicit asIterable: ((GraphLike.this)#EdgeT) => scala.collection.IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def fold[A1 >: (GraphLike.this)#EdgeT](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  60. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#EdgeT) => B): B
    Definition Classes
    IterableOnceOps
  61. def foldRight[B](z: B)(op: ((GraphLike.this)#EdgeT, B) => B): B
    Definition Classes
    IterableOnceOps
  62. def forall(p: ((GraphLike.this)#EdgeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  63. def foreach[U](f: ((GraphLike.this)#EdgeT) => U): Unit
    Definition Classes
    IterableOnceOps
  64. def fromSpecific(coll: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    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)#EdgeT) => K): Map[K, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  67. def groupMap[K, B](key: ((GraphLike.this)#EdgeT) => K)(f: ((GraphLike.this)#EdgeT) => B): Map[K, Set[B]]
    Definition Classes
    IterableOps
  68. def groupMapReduce[K, B](key: ((GraphLike.this)#EdgeT) => K)(f: ((GraphLike.this)#EdgeT) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  69. def grouped(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  70. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  71. def head: (GraphLike.this)#EdgeT
    Definition Classes
    IterableOps
  72. def headOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  73. def init: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  74. def inits: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  75. def intersect(that: Set[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
  76. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  77. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  78. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  79. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  80. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  81. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  82. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  83. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  84. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Set → Iterable → Iterable → IterableOps
  85. def knownSize: Int
    Definition Classes
    SetOps → Growable → IterableOnce
  86. def last: (GraphLike.this)#EdgeT
    Definition Classes
    IterableOps
  87. def lastOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  88. def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphLike.this)#EdgeT, B, EdgeSet.this.type]
    Definition Classes
    Iterable
  89. def map[B](f: ((GraphLike.this)#EdgeT) => B): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  90. def mapResult[NewTo](f: (Set[(GraphLike.this)#EdgeT]) => NewTo): Builder[(GraphLike.this)#EdgeT, NewTo]
    Definition Classes
    Builder
  91. def max[B >: (GraphLike.this)#EdgeT](implicit ord: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    IterableOnceOps
  92. def maxArity: Int

    The maximum arity of all edges in this edge set.

    The maximum arity of all edges in this edge set.

    Definition Classes
    EdgeSet
  93. def maxBy[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    IterableOnceOps
  94. def maxByOption[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  95. def maxOption[B >: (GraphLike.this)#EdgeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  96. def min[B >: (GraphLike.this)#EdgeT](implicit ord: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    IterableOnceOps
  97. def minBy[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    IterableOnceOps
  98. def minByOption[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  99. def minOption[B >: (GraphLike.this)#EdgeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#EdgeT]
    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)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEdgeAssoc[(GraphLike.this)#EdgeSet] 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)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    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)#EdgeT) => Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    IterableOps
  110. def partitionMap[A1, A2](f: ((GraphLike.this)#EdgeT) => Either[A1, A2]): (Set[A1], Set[A2])
    Definition Classes
    IterableOps
  111. def pipe[B](f: ((GraphLike.this)#EdgeSet) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toChainingOps[(GraphLike.this)#EdgeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  112. def product[B >: (GraphLike.this)#EdgeT](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)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  114. def reduce[B >: (GraphLike.this)#EdgeT](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  115. def reduceLeft[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) => B): B
    Definition Classes
    IterableOnceOps
  116. def reduceLeftOption[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) => B): Option[B]
    Definition Classes
    IterableOnceOps
  117. def reduceOption[B >: (GraphLike.this)#EdgeT](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  118. def reduceRight[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) => B): B
    Definition Classes
    IterableOnceOps
  119. def reduceRightOption[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  120. def remove(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetOps
  121. def result(): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps → Builder
  122. def reversed: Iterable[(GraphLike.this)#EdgeT]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  123. def scan[B >: (GraphLike.this)#EdgeT](z: B)(op: (B, B) => B): Set[B]
    Definition Classes
    IterableOps
  124. def scanLeft[B](z: B)(op: (B, (GraphLike.this)#EdgeT) => B): Set[B]
    Definition Classes
    IterableOps → IterableOnceOps
  125. def scanRight[B](z: B)(op: ((GraphLike.this)#EdgeT, B) => B): Set[B]
    Definition Classes
    IterableOps
  126. def size: Int
    Definition Classes
    IterableOnceOps
  127. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  128. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  129. final def sizeHint(coll: scala.collection.IterableOnce[_], delta: Int): Unit
    Definition Classes
    Builder
  130. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  131. final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
    Definition Classes
    Builder
  132. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  133. def slice(from: Int, until: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  135. def sliding(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  136. def span(p: ((GraphLike.this)#EdgeT) => Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    IterableOps → IterableOnceOps
  137. def splitAt(n: Int): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    IterableOps → IterableOnceOps
  138. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphLike.this)#EdgeT, S]): S
    Definition Classes
    IterableOnce
  139. def stringPrefix: String
    Definition Classes
    EdgeSet → Set → Iterable
  140. def subsetOf(that: Set[(GraphLike.this)#EdgeT]): Boolean
    Definition Classes
    SetOps
  141. def subsets(): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetOps
  142. def subsets(len: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetOps
  143. def subtractAll(xs: scala.collection.IterableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Shrinkable
  144. final def subtractOne(edge: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → Shrinkable
    Annotations
    @inline()
  145. def sum[B >: (GraphLike.this)#EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  146. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  147. val t: Set[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toTraversableEnrichments[(GraphLike.this)#EdgeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  148. def tail: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  149. def tails: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableOps
  150. def take(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  151. def takeRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  152. def takeWhile(p: ((GraphLike.this)#EdgeT) => Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  153. def tap[U](f: ((GraphLike.this)#EdgeSet) => U): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toChainingOps[(GraphLike.this)#EdgeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  154. def tapEach[U](f: ((GraphLike.this)#EdgeT) => U): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps → IterableOnceOps
  155. def to[C1](factory: Factory[(GraphLike.this)#EdgeT, C1]): C1
    Definition Classes
    IterableOnceOps
  156. def toArray[B >: (GraphLike.this)#EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  157. final def toBuffer[B >: (GraphLike.this)#EdgeT]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  158. def toIndexedSeq: IndexedSeq[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  159. def toList: List[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  160. def toMSet: MSet[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableEnrichments[(GraphLike.this)#EdgeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Definition Classes
    IterableEnrichments
  161. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#EdgeT, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  162. def toOuter: Set[E[N]]

    Converts this edge set to a set of outer edges.

    Converts this edge set to a set of outer edges.

    Definition Classes
    EdgeSet
  163. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphLike.this)#EdgeT, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toTraversableEnrichments[(GraphLike.this)#EdgeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  164. def toSeq: Seq[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  165. def toSet[B >: (GraphLike.this)#EdgeT]: Set[B]
    Definition Classes
    IterableOnceOps
  166. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.this)#EdgeOrdering = defaultEdgeOrdering): String

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

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

    separator

    to separate edges by.

    ord

    custom ordering.

    returns

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

    Definition Classes
    EdgeSet
  167. def toString(): String
    Definition Classes
    Set → Function1 → Iterable → AnyRef → Any
  168. def toVector: Vector[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOnceOps
  169. def transpose[B](implicit asIterable: ((GraphLike.this)#EdgeT) => Iterable[B]): Set[Set[B]]
    Definition Classes
    IterableOps
  170. final def union(that: Set[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  171. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#EdgeT) => (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    IterableOps
  172. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#EdgeT) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    IterableOps
  173. def update(elem: (GraphLike.this)#EdgeT, included: Boolean): Unit
    Definition Classes
    SetOps
  174. val value: (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  175. def view: View[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableOps
  176. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  177. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  178. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  179. def withFilter(p: ((GraphLike.this)#EdgeT) => Boolean): WithFilter[(GraphLike.this)#EdgeT, [_]Set[_]]
    Definition Classes
    IterableOps
  180. def withSetFilter(p: ((GraphLike.this)#EdgeT) => Boolean): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]
    Definition Classes
    FilterableSet
  181. def zip[B](that: scala.collection.IterableOnce[B]): Set[((GraphLike.this)#EdgeT, B)]
    Definition Classes
    IterableOps
  182. def zipAll[A1 >: (GraphLike.this)#EdgeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
    Definition Classes
    IterableOps
  183. def zipWithIndex: Set[((GraphLike.this)#EdgeT, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  184. final def |(that: Set[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @inline()
  185. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEdgeAssoc[(GraphLike.this)#EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  186. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toEdgeAssoc[(GraphLike.this)#EdgeSet] 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)#EdgeSet toany2stringadd[(GraphLike.this)#EdgeSet] 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:
    (edgeSet: any2stringadd[(GraphLike.this)#EdgeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) => A): (Param[(GraphLike.this)#EdgeT, EI]) => A
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to(Param[(GraphLike.this)#EdgeT, 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:
    (edgeSet: (Param[(GraphLike.this)#EdgeT, EI]) => Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[(GraphLike.this)#EdgeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to(Param[(GraphLike.this)#EdgeT, 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:
    (edgeSet: (Param[(GraphLike.this)#EdgeT, EI]) => Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) => Param[(GraphLike.this)#EdgeT, EI]): (A) => Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to(Param[(GraphLike.this)#EdgeT, 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:
    (edgeSet: (Param[(GraphLike.this)#EdgeT, EI]) => Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. val self: (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toChainingOps[(GraphLike.this)#EdgeSet] performed by method ChainingOps in scalax.collection.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeSet: ChainingOps[(GraphLike.this)#EdgeSet]).self
    Definition Classes
    ChainingOps
  6. val self: Iterable[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableEnrichments[(GraphLike.this)#EdgeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeSet: IterableEnrichments[(GraphLike.this)#EdgeT]).self
    Definition Classes
    IterableEnrichments
  7. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] 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:
    (edgeSet: OuterNode[(GraphLike.this)#EdgeSet]).stringPrefix
    Definition Classes
    NodeParam
  8. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to(Param[(GraphLike.this)#EdgeT, 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:
    (edgeSet: (Param[(GraphLike.this)#EdgeT, EI]) => Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toOuterNode[(GraphLike.this)#EdgeSet] 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:
    (edgeSet: OuterNode[(GraphLike.this)#EdgeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): Set[(GraphLike.this)#EdgeT]
    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)#EdgeT): Set[(GraphLike.this)#EdgeT]
    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)#EdgeT](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)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): EdgeSet.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)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

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

  6. def -(elem: (GraphLike.this)#EdgeT): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

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

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

    (Since version 2.13.0) Consider requiring an immutable Set

  8. def -=(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): EdgeSet.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

  9. def /:[B](z: B)(op: (B, (GraphLike.this)#EdgeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

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

    (Since version 2.13.0) Use foldLeft instead of /:

  11. def :\[B](z: B)(op: ((GraphLike.this)#EdgeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

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

    (Since version 2.13.0) Use foldRight instead of :\

  13. def aggregate[B](z: => B)(seqop: (B, (GraphLike.this)#EdgeT) => 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.

  14. def collectFirst[B](f: PartialFunction[(GraphLike.this)#EdgeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

    (Since version 2.13.0) Use iterableFactory instead

  16. def copyToBuffer(dest: Buffer[(GraphLike.this)#EdgeT]): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

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

  18. def count(f: ((GraphLike.this)#EdgeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  19. def exists(f: ((GraphLike.this)#EdgeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  20. def filter(f: ((GraphLike.this)#EdgeT) => Boolean): Iterator[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  21. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  22. def find(p: ((GraphLike.this)#EdgeT) => Boolean): Option[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  23. def flatMap[B](f: ((GraphLike.this)#EdgeT) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  24. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  25. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#EdgeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  26. def foldRight[B](z: B)(op: ((GraphLike.this)#EdgeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  27. def forall(f: ((GraphLike.this)#EdgeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  28. def foreach[U](f: ((GraphLike.this)#EdgeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  29. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toStringFormat[(GraphLike.this)#EdgeSet] 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.

  30. 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)

  31. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  32. def map[B](f: ((GraphLike.this)#EdgeT) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  33. def max(implicit ord: Ordering[(GraphLike.this)#EdgeT]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  34. def maxBy[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  35. def min(implicit ord: Ordering[(GraphLike.this)#EdgeT]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  36. def minBy[B](f: ((GraphLike.this)#EdgeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  37. def mkString: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  38. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  40. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  41. def product(implicit num: Numeric[(GraphLike.this)#EdgeT]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  42. def reduce(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  43. def reduceLeft(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  44. def reduceLeftOption(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): Option[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  45. def reduceOption(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): Option[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  46. def reduceRight(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  47. def reduceRightOption(f: ((GraphLike.this)#EdgeT, (GraphLike.this)#EdgeT) => (GraphLike.this)#EdgeT): Option[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  48. final def repr: Set[(GraphLike.this)#EdgeT]
    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

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

    (Since version 2.13.0) Use filterInPlace instead

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

    (Since version 2.13.0) Use .iterator.sameElements instead

  51. def seq: EdgeSet.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  52. def size: Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  53. def sum(implicit num: Numeric[(GraphLike.this)#EdgeT]): (GraphLike.this)#EdgeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  54. def to[C1](factory: Factory[(GraphLike.this)#EdgeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  55. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  56. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  57. def toEdgeInSet: Set[E[N]]
    Definition Classes
    EdgeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

  58. def toIndexedSeq: IndexedSeq[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  59. final def toIterable: Iterable[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  60. final def toIterable: EdgeSet.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

  61. def toIterator: Iterator[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

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

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

  63. def toList: List[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  64. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#EdgeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  65. def toSeq: Seq[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  66. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  67. def toStream: Stream[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

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

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

  69. final def toTraversable: Traversable[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  70. final def toTraversable: Traversable[(GraphLike.this)#EdgeT]
    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

  71. def toVector: Vector[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

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

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

  73. def withFilter(f: ((GraphLike.this)#EdgeT) => Boolean): Iterator[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toIterableOnceExtensionMethods[(GraphLike.this)#EdgeT] 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:
    (edgeSet: IterableOnceExtensionMethods[(GraphLike.this)#EdgeT]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  74. def →[B](y: B): ((GraphLike.this)#EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet toArrowAssoc[(GraphLike.this)#EdgeSet] 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 AddSubtract[(GraphLike.this)#EdgeT, (GraphLike.this)#EdgeSet]

Inherited from (GraphLike.this)#EdgeSet

Inherited from (GraphLike.this)#EdgeSet

Inherited from Serializable

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

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

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

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

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

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

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

Inherited from Clearable

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

Inherited from Cloneable

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

Inherited from Equals

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

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

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

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

Inherited by implicit conversion IterableEnrichments from(GraphLike.this)#EdgeSet to IterableEnrichments[(GraphLike.this)#EdgeT]

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

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

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

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

Ungrouped