scalax.collection.GraphLike

EdgeSet

trait EdgeSet extends This.EdgeSet

Linear Supertypes
This.EdgeSet, Serializable, Serializable, ExtSetMethods[This.EdgeT], Set[This.EdgeT], SetLike[This.EdgeT, Set[This.EdgeT]], Subtractable[This.EdgeT, Set[This.EdgeT]], GenSet[This.EdgeT], GenericSetTemplate[This.EdgeT, Set], GenSetLike[This.EdgeT, Set[This.EdgeT]], Iterable[This.EdgeT], IterableLike[This.EdgeT, Set[This.EdgeT]], Equals, GenIterable[This.EdgeT], GenIterableLike[This.EdgeT, Set[This.EdgeT]], Traversable[This.EdgeT], GenTraversable[This.EdgeT], GenericTraversableTemplate[This.EdgeT, Set], TraversableLike[This.EdgeT, Set[This.EdgeT]], GenTraversableLike[This.EdgeT, Set[This.EdgeT]], Parallelizable[This.EdgeT, ParSet[This.EdgeT]], TraversableOnce[This.EdgeT], GenTraversableOnce[This.EdgeT], FilterMonadic[This.EdgeT, Set[This.EdgeT]], HasNewBuilder[This.EdgeT, Set[This.EdgeT]], (This.EdgeT) ⇒ Boolean, AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeSet
  2. EdgeSet
  3. Serializable
  4. Serializable
  5. ExtSetMethods
  6. Set
  7. SetLike
  8. Subtractable
  9. GenSet
  10. GenericSetTemplate
  11. GenSetLike
  12. Iterable
  13. IterableLike
  14. Equals
  15. GenIterable
  16. GenIterableLike
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. Function1
  28. AnyRef
  29. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by graphParamsToPartition
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Set[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +(elem: This.EdgeT): Set[This.EdgeT]

    Definition Classes
    SetLike → GenSetLike
  2. abstract def -(elem: This.EdgeT): Set[This.EdgeT]

    Definition Classes
    SetLike → Subtractable → GenSetLike
  3. abstract def contains(node: This.NodeT): Boolean

    Definition Classes
    EdgeSet
  4. abstract def contains(elem: This.EdgeT): Boolean

    Definition Classes
    SetLike → GenSetLike
  5. abstract def find(outerEdge: E[N]): Option[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
  6. 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[scalax.collection]
    Definition Classes
    EdgeSet
  7. abstract def iterator: Iterator[This.EdgeT]

    Definition Classes
    GenSetLike → GenIterableLike

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[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike
  5. def +(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

    Definition Classes
    SetLike
  6. def ++(elems: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    SetLike
  7. def ++[B >: This.EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: This.EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike
  9. def ++:[B >: This.EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike
  10. def -(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    Subtractable
  12. def ->[B](y: B): (This.EdgeSet, B)

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. def /:[B](z: B)(op: (B, This.EdgeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: (This.EdgeT, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def addString(b: StringBuilder): StringBuilder

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

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

    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: ⇒ B)(seqop: (B, This.EdgeT) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def andThen[A](g: (Boolean) ⇒ A): (This.EdgeT) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  21. def apply(elem: This.EdgeT): Boolean

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

    Definition Classes
    Any
  23. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: 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
  24. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals
  25. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. def collect[B, That](pf: PartialFunction[This.EdgeT, B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[This.EdgeT, B]): Option[B]

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

    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  29. def compose[A](g: (A) ⇒ This.EdgeT): (A) ⇒ Boolean

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: This.EdgeT](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: This.EdgeT](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  34. def count(p: (This.EdgeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def diff(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    SetLike → GenSetLike
  36. final def draw(random: Random): 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
    EdgeSetExtSetMethods
  37. def drop(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike
  39. def dropWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  40. def edgeParams: Iterable[EdgeParam]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  41. val elems: Iterable[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  42. def empty: Set[This.EdgeT]

    Definition Classes
    GenericSetTemplate
  43. def ensuring(cond: (This.EdgeSet) ⇒ Boolean, msg: ⇒ Any): This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  44. def ensuring(cond: (This.EdgeSet) ⇒ Boolean): This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: Boolean, msg: ⇒ Any): This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean): This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  49. def exists(p: (This.EdgeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def filter(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  51. def filterNot(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  53. def find(p: (This.EdgeT) ⇒ Boolean): Option[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. final def findEntry[B](other: B, correspond: (This.EdgeT, B) ⇒ Boolean): 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
    EdgeSetExtSetMethods
  55. def flatMap[B, That](f: (This.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  56. def flatten[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[B]

    Definition Classes
    GenericTraversableTemplate
  57. def fold[A1 >: This.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def foldLeft[B](z: B)(op: (B, This.EdgeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def foldRight[B](z: B)(op: (This.EdgeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  60. def forall(p: (This.EdgeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def foreach[U](f: (This.EdgeT) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  62. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to StringFormat[This.EdgeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  63. def genericBuilder[B]: Builder[B, Set[B]]

    Definition Classes
    GenericTraversableTemplate
  64. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  65. def groupBy[K](f: (This.EdgeT) ⇒ K): Map[K, Set[This.EdgeT]]

    Definition Classes
    TraversableLike → GenTraversableLike
  66. def grouped(size: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike
  67. def hasDefiniteSize: Boolean

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

    Definition Classes
    GenSetLike → AnyRef → Any
  69. def head: This.EdgeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  70. def headOption: Option[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  71. def init: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  72. def inits: Iterator[Set[This.EdgeT]]

    Definition Classes
    TraversableLike
  73. def intersect(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike
  74. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  75. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  76. def isEmpty: Boolean

    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  77. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  78. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  79. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  80. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  81. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  82. def last: This.EdgeT

    Definition Classes
    TraversableLike → GenTraversableLike
  83. def lastOption: Option[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  84. def map[B, That](f: (This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[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.

  85. def max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. 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
  87. def maxBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def min[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def minBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString: String

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. val n1: This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  94. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  95. def newBuilder: Builder[This.EdgeT, Set[This.EdgeT]]

    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  96. def nodeParams: Iterable[NodeParam[N]]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  97. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def notify(): Unit

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

    Definition Classes
    AnyRef
  100. def par: ParSet[This.EdgeT]

    Definition Classes
    Parallelizable
  101. def parCombiner: Combiner[This.EdgeT, ParSet[This.EdgeT]]

    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  102. def partition(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike
  103. lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  104. def product[B >: This.EdgeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduce[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def reduceLeft[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): B

    Definition Classes
    TraversableOnce
  107. def reduceLeftOption[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def reduceOption[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def reduceRight[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  110. def reduceRightOption[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def repr: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  112. def reversed: List[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  113. def sameElements[B >: This.EdgeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  114. def scan[B >: This.EdgeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  115. def scanLeft[B, That](z: B)(op: (B, This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  116. def scanRight[B, That](z: B)(op: (This.EdgeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[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.

  117. def seq: Set[This.EdgeT]

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def slice(from: Int, until: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  120. def sliding(size: Int, step: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike
  121. def sliding(size: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike
  122. def span(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike
  123. def splitAt(n: Int): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike
  124. def stringPrefix: String

    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike
  125. def subsetOf(that: GenSet[This.EdgeT]): Boolean

    Definition Classes
    GenSetLike
  126. def subsets: Iterator[Set[This.EdgeT]]

    Definition Classes
    SetLike
  127. def subsets(len: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    SetLike
  128. def sum[B >: This.EdgeT](implicit num: Numeric[B]): B

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

    Definition Classes
    AnyRef
  130. def tail: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike
  131. def tails: Iterator[Set[This.EdgeT]]

    Definition Classes
    TraversableLike
  132. def take(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  133. def takeRight(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike
  134. def takeWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  135. def thisCollection: Iterable[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  136. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.EdgeT, Col[This.EdgeT]]): Col[This.EdgeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  137. def toArray[B >: This.EdgeT](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toBuffer[A1 >: This.EdgeT]: Buffer[A1]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  139. def toCollection(repr: Set[This.EdgeT]): Iterable[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  140. def toInParams: Iterable[InParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  141. def toIndexedSeq: IndexedSeq[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toIterable: Iterable[This.EdgeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  143. def toIterator: Iterator[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  144. def toList: List[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toMap[T, U](implicit ev: <:<[This.EdgeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. 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
  147. def toOuterEdges: Iterable[E[N]]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  148. def toOuterNodes: Iterable[N]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  149. def toParArray: ParArray[T]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to CollectionsHaveToParArray[This.EdgeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.EdgeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  150. def toSeq: Seq[This.EdgeT]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  151. def toSet[B >: This.EdgeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: 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
  153. def toStream: Stream[This.EdgeT]

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

    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  155. def toTraversable: Traversable[This.EdgeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  156. def toVector: Vector[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def transpose[B](implicit asTraversable: (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.

  158. def union(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    SetLike → GenSetLike
  159. def unzip[A1, A2](implicit asPair: (This.EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Definition Classes
    GenericTraversableTemplate
  160. def unzip3[A1, A2, A3](implicit asTriple: (This.EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Definition Classes
    GenericTraversableTemplate
  161. val value: This.EdgeSet

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  162. def view(from: Int, until: Int): IterableView[This.EdgeT, Set[This.EdgeT]]

    Definition Classes
    IterableLike → TraversableLike
  163. def view: IterableView[This.EdgeT, Set[This.EdgeT]]

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  167. def withFilter(p: (This.EdgeT) ⇒ Boolean): FilterMonadic[This.EdgeT, Set[This.EdgeT]]

    Definition Classes
    TraversableLike → FilterMonadic
  168. def zip[A1 >: This.EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  169. def zipAll[B, A1 >: This.EdgeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  170. def zipWithIndex[A1 >: This.EdgeT, That](implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  171. def |(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike
  172. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  173. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  174. def [B](y: B): (This.EdgeSet, B)

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to any2stringadd[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[This.EdgeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[This.EdgeT, EI]) ⇒ A

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to (Param[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[This.EdgeT, EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[This.EdgeT, EI]): Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to (Param[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[This.EdgeT, EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[This.EdgeT, EI]): (A) ⇒ Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to (Param[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[This.EdgeT, EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (This.EdgeT) ⇒ Boolean): TraversableOnce[This.EdgeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[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[This.EdgeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (This.EdgeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[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[This.EdgeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[This.NodeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to FlattenOps[This.NodeT] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (Iterable[This.NodeT]) ⇒ TraversableOnce[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[This.NodeT]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: (This.EdgeT) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[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[This.EdgeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[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[This.EdgeSet]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[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[This.EdgeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def toString(): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to (Param[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[This.EdgeT, EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  12. def withFilter(p: (This.EdgeT) ⇒ Boolean): Iterator[This.EdgeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[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[This.EdgeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def toEdgeInSet: Set[E[N]]

    Definition Classes
    EdgeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from This.EdgeSet

Inherited from Serializable

Inherited from Serializable

Inherited from ExtSetMethods[This.EdgeT]

Inherited from Set[This.EdgeT]

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

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

Inherited from GenSet[This.EdgeT]

Inherited from GenericSetTemplate[This.EdgeT, Set]

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

Inherited from Iterable[This.EdgeT]

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

Inherited from Equals

Inherited from GenIterable[This.EdgeT]

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

Inherited from Traversable[This.EdgeT]

Inherited from GenTraversable[This.EdgeT]

Inherited from GenericTraversableTemplate[This.EdgeT, Set]

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

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

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

Inherited from TraversableOnce[This.EdgeT]

Inherited from GenTraversableOnce[This.EdgeT]

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

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

Inherited from (This.EdgeT) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion MonadOps from This.EdgeSet to MonadOps[This.EdgeT]

Inherited by implicit conversion flattenTraversableOnce from This.EdgeSet to FlattenOps[This.NodeT]

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

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

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

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

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

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

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

Inherited by implicit conversion alternateImplicit from This.EdgeSet to ForceImplicitAmbiguity

Ungrouped