Packages

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

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

Type Members

  1. type Self = Set[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

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
    SetLike → GenSetLike
  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: Traversable[E[N]]): Unit

    This method is called by the primary constructor.

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

    edges

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSet
  10. abstract def iterator: Iterator[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike → GenIterableLike
  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. def &(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  5. def +(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

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

  6. def +(elem: (GraphLike.this)#EdgeT): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

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

  7. def ++(xs: GenTraversableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

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

  8. def ++[B >: (GraphLike.this)#EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: (GraphLike.this)#EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: (GraphLike.this)#EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Growable
  12. final def +=(edge: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → SetLike → Builder → Growable
    Annotations
    @inline()
  13. def +=(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): EdgeSet.this.type
    Definition Classes
    Growable
  14. def -(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

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

  15. def -(elem: (GraphLike.this)#EdgeT): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → SetLike → Subtractable → GenSetLike
    Annotations
    @migration
    Migration

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

  16. def --(xs: GenTraversableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

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

  17. def --=(xs: TraversableOnce[(GraphLike.this)#EdgeT]): EdgeSet.this.type
    Definition Classes
    Shrinkable
  18. final def -=(edge: (GraphLike.this)#EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → SetLike → Shrinkable
    Annotations
    @inline()
  19. def -=(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): EdgeSet.this.type
    Definition Classes
    Shrinkable
  20. def ->[B](y: B): ((GraphLike.this)#EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to ArrowAssoc[(GraphLike.this)#EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  21. def /:[B](z: B)(op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def :\[B](z: B)(op: ((GraphLike.this)#EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  24. def add(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetLike
  25. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  26. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  27. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  28. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphLike.this)#EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def andThen[A](g: (Boolean) ⇒ A): ((GraphLike.this)#EdgeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. def apply(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    GenSetLike → Function1
  31. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  32. 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
  33. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  34. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  35. def clone(): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  36. def collect[B, That](pf: PartialFunction[(GraphLike.this)#EdgeT, B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#EdgeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  38. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  39. def compose[A](g: (A) ⇒ (GraphLike.this)#EdgeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  40. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  41. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def copyToBuffer[B >: (GraphLike.this)#EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  44. def count(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def diff(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → GenSetLike
  46. 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.

    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
  47. def drop(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  48. def dropRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike
  49. def dropWhile(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def empty: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenericSetTemplate
  51. 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 to Ensuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  52. def ensuring(cond: ((GraphLike.this)#EdgeSet) ⇒ Boolean): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to Ensuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  53. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to Ensuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: Boolean): (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to Ensuring[(GraphLike.this)#EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  56. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  57. def exists(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. def filter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def filterNot(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  61. def find(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  62. 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
  63. def flatMap[B, That](f: ((GraphLike.this)#EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  64. def flatten[B](implicit asTraversable: ((GraphLike.this)#EdgeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  65. def fold[A1 >: (GraphLike.this)#EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def foldRight[B](z: B)(op: ((GraphLike.this)#EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  68. def forall(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. def foreach[U](f: ((GraphLike.this)#EdgeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  70. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to StringFormat[(GraphLike.this)#EdgeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  71. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  72. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  73. def groupBy[K](f: ((GraphLike.this)#EdgeT) ⇒ K): Map[K, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def grouped(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  75. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  76. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  77. def head: (GraphLike.this)#EdgeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  78. def headOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def init: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def inits: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike
  81. def intersect(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  82. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  83. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  84. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  85. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  86. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  87. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  88. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  89. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  90. def last: (GraphLike.this)#EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def lastOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def map[B, That](f: ((GraphLike.this)#EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  93. def mapResult[NewTo](f: (Set[(GraphLike.this)#EdgeT]) ⇒ NewTo): Builder[(GraphLike.this)#EdgeT, NewTo]
    Definition Classes
    Builder
  94. def max[B >: (GraphLike.this)#EdgeT](implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. 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
  96. def maxBy[B](f: ((GraphLike.this)#EdgeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def min[B >: (GraphLike.this)#EdgeT](implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def minBy[B](f: ((GraphLike.this)#EdgeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. val n1: (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to EdgeAssoc[(GraphLike.this)#EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  103. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  104. def newBuilder: Builder[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  105. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  107. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  108. def par: ParSet[(GraphLike.this)#EdgeT]
    Definition Classes
    Parallelizable
  109. def parCombiner: Combiner[(GraphLike.this)#EdgeT, ParSet[(GraphLike.this)#EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  110. def partition(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def product[B >: (GraphLike.this)#EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def reduce[A1 >: (GraphLike.this)#EdgeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceLeft[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  114. def reduceLeftOption[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduceOption[A1 >: (GraphLike.this)#EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceRight[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  117. def reduceRightOption[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def remove(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetLike
  119. def repr: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def result(): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → Builder
  121. def retain(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  122. def reversed: List[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  123. def sameElements[B >: (GraphLike.this)#EdgeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  124. def scan[B >: (GraphLike.this)#EdgeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def scanLeft[B, That](z: B)(op: (B, (GraphLike.this)#EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def scanRight[B, That](z: B)(op: ((GraphLike.this)#EdgeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  127. def seq: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  128. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  130. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  131. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  132. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  133. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  134. def slice(from: Int, until: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  135. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  136. def sliding(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  137. def span(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def splitAt(n: Int): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def stringPrefix: String
    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike
  140. def subsetOf(that: GenSet[(GraphLike.this)#EdgeT]): Boolean
    Definition Classes
    GenSetLike
  141. def subsets(): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetLike
  142. def subsets(len: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetLike
  143. def sum[B >: (GraphLike.this)#EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  145. def tail: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  146. def tails: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike
  147. def take(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  148. def takeRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike
  149. def takeWhile(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  150. def thisCollection: Iterable[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  151. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphLike.this)#EdgeT, Col[(GraphLike.this)#EdgeT]]): Col[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  152. def toArray[B >: (GraphLike.this)#EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def toBuffer[A1 >: (GraphLike.this)#EdgeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  154. def toCollection(repr: Set[(GraphLike.this)#EdgeT]): Iterable[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  155. def toIndexedSeq: IndexedSeq[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toIterable: Iterable[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  157. def toIterator: Iterator[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  158. def toList: List[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toMap[T, U](implicit ev: <:<[(GraphLike.this)#EdgeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. 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
  161. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to CollectionsHaveToParArray[(GraphLike.this)#EdgeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphLike.this)#EdgeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  162. def toSeq: Seq[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  163. def toSet[B >: (GraphLike.this)#EdgeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. 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
  165. def toStream: Stream[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  166. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  167. def toTraversable: Traversable[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  168. def toVector: Vector[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def transpose[B](implicit asTraversable: ((GraphLike.this)#EdgeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  170. def union(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → GenSetLike
  171. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  172. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  173. def update(elem: (GraphLike.this)#EdgeT, included: Boolean): Unit
    Definition Classes
    SetLike
  174. val value: (GraphLike.this)#EdgeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(GraphLike.this)#EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  175. def view(from: Int, until: Int): IterableView[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  176. def view: IterableView[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  177. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  178. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  179. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  180. def withFilter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): FilterMonadic[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  181. def withSetFilter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): FilteredSet[(GraphLike.this)#EdgeT]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  182. def zip[A1 >: (GraphLike.this)#EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  183. def zipAll[B, A1 >: (GraphLike.this)#EdgeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  184. def zipWithIndex[A1 >: (GraphLike.this)#EdgeT, That](implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  185. def |(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  186. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to EdgeAssoc[(GraphLike.this)#EdgeSet] 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)#EdgeSet to EdgeAssoc[(GraphLike.this)#EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  188. def →[B](y: B): ((GraphLike.this)#EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to ArrowAssoc[(GraphLike.this)#EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to any2stringadd[(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. def filter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): TraversableOnce[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to MonadOps[(GraphLike.this)#EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeSet: MonadOps[(GraphLike.this)#EdgeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: ((GraphLike.this)#EdgeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to MonadOps[(GraphLike.this)#EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeSet: MonadOps[(GraphLike.this)#EdgeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to FlattenOps[(GraphLike.this)#NodeT] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (Iterable[(GraphLike.this)#NodeT]) ⇒ TraversableOnce[(GraphLike.this)#NodeT] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeSet: FlattenOps[(GraphLike.this)#NodeT]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: ((GraphLike.this)#EdgeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to MonadOps[(GraphLike.this)#EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeSet: MonadOps[(GraphLike.this)#EdgeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(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
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to OuterNode[(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
  11. 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
  12. def withFilter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Iterator[(GraphLike.this)#EdgeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#EdgeSet to MonadOps[(GraphLike.this)#EdgeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeSet: MonadOps[(GraphLike.this)#EdgeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def <<(cmd: Message[(GraphLike.this)#EdgeT]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

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

    (Since version 1.8.0) Use toOuter instead

Inherited from (GraphLike.this)#EdgeSet

Inherited from (GraphLike.this)#EdgeSet

Inherited from Serializable

Inherited from Serializable

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

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

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

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

Inherited from Cloneable

Inherited from Cloneable

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 Scriptable[(GraphLike.this)#EdgeT]

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

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

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

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

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

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

Inherited from ((GraphLike.this)#EdgeT) ⇒ Boolean

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

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

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

Inherited from Equals

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

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

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

Inherited from Mutable

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

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

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

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

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

Inherited from Parallelizable[(GraphLike.this)#EdgeT, ParSet[(GraphLike.this)#EdgeT]]

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

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

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

Inherited from HasNewBuilder[(GraphLike.this)#EdgeT, scala.collection.mutable.Set[GraphLike.this.EdgeT] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion CollectionsHaveToParArray from (GraphLike.this)#EdgeSet to CollectionsHaveToParArray[(GraphLike.this)#EdgeSet, T]

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

Inherited by implicit conversion flattenTraversableOnce from (GraphLike.this)#EdgeSet to FlattenOps[(GraphLike.this)#NodeT]

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

Inherited by implicit conversion alternateImplicit from (GraphLike.this)#EdgeSet to ForceImplicitAmbiguity

Ungrouped