Packages

trait EdgeSet extends (GraphLike.this)#EdgeSet

Linear Supertypes
(GraphLike.this)#EdgeSet, Serializable, Serializable, ExtSetMethods[(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]], 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], 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, Set[(GraphLike.this)#EdgeT]], ((GraphLike.this)#EdgeT) ⇒ Boolean, AnyRef, Any
Known Subclasses
EdgeSet, EdgeSet, EdgeSet, EdgeSet
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 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 +(elem: (GraphLike.this)#EdgeT): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → GenSetLike
  2. abstract def -(elem: (GraphLike.this)#EdgeT): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → Subtractable → GenSetLike
  3. abstract def contains(node: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    EdgeSet
  4. abstract def contains(elem: (GraphLike.this)#EdgeT): Boolean
    Definition Classes
    SetLike → GenSetLike
  5. 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
  6. abstract def hasAnyHyperEdge: Boolean
  7. abstract def hasAnyMultiEdge: Boolean
  8. abstract def hasMixedEdges: Boolean
  9. abstract def hasOnlyDiEdges: Boolean
  10. abstract def hasOnlyUnDiEdges: Boolean
  11. 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
  12. abstract def iterator: Iterator[(GraphLike.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[(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
  6. def ++(elems: GenTraversableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike
  7. def ++[B >: (GraphLike.this)#EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: (GraphLike.this)#EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++:[B >: (GraphLike.this)#EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def -(elem1: (GraphLike.this)#EdgeT, elem2: (GraphLike.this)#EdgeT, elems: (GraphLike.this)#EdgeT*): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    Subtractable
  12. 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()
  13. def /:[B](z: B)(op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: ((GraphLike.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, (GraphLike.this)#EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def andThen[A](g: (Boolean) ⇒ A): ((GraphLike.this)#EdgeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  21. def apply(elem: (GraphLike.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: (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
  24. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  25. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  26. def collect[B, That](pf: PartialFunction[(GraphLike.this)#EdgeT, B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[(GraphLike.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) ⇒ (GraphLike.this)#EdgeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: (GraphLike.this)#EdgeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: (GraphLike.this)#EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def count(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def diff(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → GenSetLike
  36. 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
  37. def drop(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike
  39. def dropWhile(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def empty: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenericSetTemplate
  41. 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
  42. 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
  43. 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
  44. 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
  45. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  47. def exists(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def filter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def filterNot(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  51. def find(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Option[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. 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
  53. 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
  54. def flatten[B](implicit asTraversable: ((GraphLike.this)#EdgeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  55. def fold[A1 >: (GraphLike.this)#EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def foldRight[B](z: B)(op: ((GraphLike.this)#EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  58. def forall(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def foreach[U](f: ((GraphLike.this)#EdgeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  60. 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()
  61. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  62. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  63. def groupBy[K](f: ((GraphLike.this)#EdgeT) ⇒ K): Map[K, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def grouped(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  65. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  67. def head: (GraphLike.this)#EdgeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  68. def headOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def init: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def inits: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike
  71. def intersect(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  72. 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
  73. 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
  74. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  75. 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
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. 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
  78. 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
  79. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  80. def last: (GraphLike.this)#EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def lastOption: Option[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. 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.

  83. def max[B >: (GraphLike.this)#EdgeT](implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. 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
  85. def maxBy[B](f: ((GraphLike.this)#EdgeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: (GraphLike.this)#EdgeT](implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: ((GraphLike.this)#EdgeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. 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
  92. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  93. def newBuilder: Builder[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  94. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  96. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  97. def par: ParSet[(GraphLike.this)#EdgeT]
    Definition Classes
    Parallelizable
  98. def parCombiner: Combiner[(GraphLike.this)#EdgeT, ParSet[(GraphLike.this)#EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  99. def partition(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def product[B >: (GraphLike.this)#EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduce[A1 >: (GraphLike.this)#EdgeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceLeft[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  103. def reduceLeftOption[B >: (GraphLike.this)#EdgeT](op: (B, (GraphLike.this)#EdgeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceOption[A1 >: (GraphLike.this)#EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduceRight[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  106. def reduceRightOption[B >: (GraphLike.this)#EdgeT](op: ((GraphLike.this)#EdgeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def repr: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def reversed: List[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  109. def sameElements[B >: (GraphLike.this)#EdgeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  110. 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
  111. 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
  112. 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.

  113. def seq: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  114. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  116. def slice(from: Int, until: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  117. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  118. def sliding(size: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike
  119. def span(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def splitAt(n: Int): (Set[(GraphLike.this)#EdgeT], Set[(GraphLike.this)#EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def stringPrefix: String
    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike
  122. def subsetOf(that: GenSet[(GraphLike.this)#EdgeT]): Boolean
    Definition Classes
    GenSetLike
  123. def subsets(): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetLike
  124. def subsets(len: Int): Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    SetLike
  125. def sum[B >: (GraphLike.this)#EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  127. def tail: Set[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def tails: Iterator[Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike
  129. def take(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def takeRight(n: Int): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike
  131. def takeWhile(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  132. def thisCollection: Iterable[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  133. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphLike.this)#EdgeT, Col[(GraphLike.this)#EdgeT]]): Col[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  134. def toArray[B >: (GraphLike.this)#EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toBuffer[A1 >: (GraphLike.this)#EdgeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  136. def toCollection(repr: Set[(GraphLike.this)#EdgeT]): Iterable[(GraphLike.this)#EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  137. def toIndexedSeq: IndexedSeq[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toIterable: Iterable[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  139. def toIterator: Iterator[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  140. def toList: List[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toMap[T, U](implicit ev: <:<[(GraphLike.this)#EdgeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. 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
  143. 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
  144. def toSeq: Seq[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  145. def toSet[B >: (GraphLike.this)#EdgeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. 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
  147. def toStream: Stream[(GraphLike.this)#EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  148. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  149. def toTraversable: Traversable[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  150. def toVector: Vector[(GraphLike.this)#EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. 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.

  152. def union(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    SetLike → GenSetLike
  153. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  154. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  155. 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
  156. def view(from: Int, until: Int): IterableView[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  157. def view: IterableView[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  158. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  159. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  160. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  161. def withFilter(p: ((GraphLike.this)#EdgeT) ⇒ Boolean): FilterMonadic[(GraphLike.this)#EdgeT, Set[(GraphLike.this)#EdgeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  162. 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
  163. 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
  164. 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
  165. def zipWithIndex[A1 >: (GraphLike.this)#EdgeT, That](implicit bf: CanBuildFrom[Set[(GraphLike.this)#EdgeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  166. def |(that: GenSet[(GraphLike.this)#EdgeT]): Set[(GraphLike.this)#EdgeT]
    Definition Classes
    GenSetLike
  167. 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()
  168. 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()
  169. 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 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 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 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 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 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, Set[(GraphLike.this)#EdgeT]]

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

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