scalax.collection.GraphBase

EdgeBase

class EdgeBase extends EdgeOut[N, E, NodeT, E] with InnerEdgeLike

Linear Supertypes
InnerEdgeLike, Edge, Serializable, Serializable, Iterable[NodeT], IterableLike[NodeT, Iterable[NodeT]], Equals, GenIterable[NodeT], GenIterableLike[NodeT, Iterable[NodeT]], Traversable[NodeT], GenTraversable[NodeT], GenericTraversableTemplate[NodeT, Iterable], TraversableLike[NodeT, Iterable[NodeT]], GenTraversableLike[NodeT, Iterable[NodeT]], Parallelizable[NodeT, ParIterable[NodeT]], TraversableOnce[NodeT], GenTraversableOnce[NodeT], FilterMonadic[NodeT, Iterable[NodeT]], HasNewBuilder[NodeT, Iterable[NodeT]], EdgeOut[N, E, NodeT, E], GraphParamEdge, GraphParamOut[N, E], GraphParam[N, E], AnyRef, Any
Known Subclasses
EdgeImpl
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeBase
  2. InnerEdgeLike
  3. Edge
  4. Serializable
  5. Serializable
  6. Iterable
  7. IterableLike
  8. Equals
  9. GenIterable
  10. GenIterableLike
  11. Traversable
  12. GenTraversable
  13. GenericTraversableTemplate
  14. TraversableLike
  15. GenTraversableLike
  16. Parallelizable
  17. TraversableOnce
  18. GenTraversableOnce
  19. FilterMonadic
  20. HasNewBuilder
  21. EdgeOut
  22. GraphParamEdge
  23. GraphParamOut
  24. GraphParam
  25. AnyRef
  26. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeBase(edge: E[NodeT])

Type Members

  1. type Self = Iterable[NodeT]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike

  6. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike

  7. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  8. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce

  14. def adjacents: Set[EdgeT]

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    returns

    set of connecting edges including hooks.

    Definition Classes
    InnerEdgeLike

  15. def aggregate[B](z: B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  17. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdgeLike → IterableLike → Equals

  18. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  19. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  20. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]

    Definition Classes
    TraversableOnce

  21. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  22. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  23. def copyToArray[B >: NodeT](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  24. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  26. def count(p: (NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def drop(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  28. def dropRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  29. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  30. val edge: E[NodeT]

    The outer edge after transformation by means of the copy method.

    The outer edge after transformation by means of the copy method. This edge contains references to inner nodes while the original outer edge contained references to outer nodes.

    Definition Classes
    EdgeBase → InnerEdgeLike → EdgeOut

  31. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  32. def equals(other: Any): Boolean

    Definition Classes
    InnerEdgeLike → Equals → AnyRef → Any

  33. def exists(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  34. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  35. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  36. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  37. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  38. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  39. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  40. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  41. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  42. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  43. def forall(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  44. def foreach[U](f: (NodeT) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  45. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate

  46. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  47. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  48. def grouped(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  49. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  50. def hashCode(): Int

    Definition Classes
    InnerEdgeLike → AnyRef → Any

  51. def head: NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  52. def headOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  53. def init: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  54. def inits: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  55. def isEdge: Boolean

    Definition Classes
    GraphParamEdge

  56. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  57. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  58. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  59. def isNode: Boolean

    Definition Classes
    GraphParamEdge

  60. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  61. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  62. def iterator: Iterator[NodeT]

    Definition Classes
    EdgeBase → IterableLike → GenIterableLike

  63. def last: NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  64. def lastOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  65. def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  66. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  67. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  68. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  69. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  74. def newBuilder: Builder[NodeT, Iterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  75. final def nodes: InnerEdgeLike

    The inner nodes incident with this inner edge.

    The inner nodes incident with this inner edge. This is just a synonym to this that extends Iterable[NodeT].

    Definition Classes
    InnerEdgeLike
    Annotations
    @inline()

  76. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  77. final def notify(): Unit

    Definition Classes
    AnyRef

  78. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  79. def par: ParIterable[NodeT]

    Definition Classes
    Parallelizable

  80. def parCombiner: Combiner[NodeT, ParIterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  81. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  82. def privateNodes: Set[NodeT]

    Finds nodes of this edge which only participate in this edge.

    Finds nodes of this edge which only participate in this edge.

    returns

    those nodes of this edge which do not participate in any other edge

    Definition Classes
    InnerEdgeLike

  83. def product[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  84. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce

  86. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  89. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  90. def repr: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  91. def reversed: List[NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  92. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  93. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  94. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  95. def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], 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.

  96. def seq: Iterable[NodeT]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  97. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def slice(from: Int, until: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  99. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  100. def sliding(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  101. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  102. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  103. def stringPrefix: String

    Definition Classes
    EdgeBase → TraversableLike → GenTraversableLike → EdgeOut

  104. def sum[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  105. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  106. def tail: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  107. def tails: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  108. def take(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  109. def takeRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  110. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  111. def thisCollection: Iterable[NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  112. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  113. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def toBuffer[B >: NodeT]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def toCollection(repr: Iterable[NodeT]): Iterable[NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  116. def toEdgeIn: E[N]

    Reconstructs the outer edge by means of the copymethod.

    Reconstructs the outer edge by means of the copymethod.

    Definition Classes
    InnerEdgeLike

  117. def toIndexedSeq: IndexedSeq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def toIterable: Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  119. def toIterator: Iterator[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  120. def toList: List[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toSeq: Seq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def toSet[B >: NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  124. def toStream: Stream[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  125. def toString(): String

    Definition Classes
    InnerEdgeLike → TraversableLike → AnyRef → Any

  126. def toTraversable: Traversable[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  127. def toVector: Vector[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  128. def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  129. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  130. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  131. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  132. def view: IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  133. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  134. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  135. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  136. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]

    Definition Classes
    TraversableLike → FilterMonadic

  137. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  138. def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  139. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  140. final def ~~: Set[EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdgeLike
    Annotations
    @inline()

Deprecated Value Members

  1. def /:\[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from InnerEdgeLike

Inherited from Edge

Inherited from Serializable

Inherited from Serializable

Inherited from Iterable[NodeT]

Inherited from IterableLike[NodeT, Iterable[NodeT]]

Inherited from Equals

Inherited from GenIterable[NodeT]

Inherited from GenIterableLike[NodeT, Iterable[NodeT]]

Inherited from Traversable[NodeT]

Inherited from GenTraversable[NodeT]

Inherited from GenericTraversableTemplate[NodeT, Iterable]

Inherited from TraversableLike[NodeT, Iterable[NodeT]]

Inherited from GenTraversableLike[NodeT, Iterable[NodeT]]

Inherited from Parallelizable[NodeT, ParIterable[NodeT]]

Inherited from TraversableOnce[NodeT]

Inherited from GenTraversableOnce[NodeT]

Inherited from FilterMonadic[NodeT, Iterable[NodeT]]

Inherited from HasNewBuilder[NodeT, Iterable[NodeT]]

Inherited from EdgeOut[N, E, NodeT, E]

Inherited from GraphParamEdge

Inherited from GraphParamOut[N, E]

Inherited from GraphParam[N, E]

Inherited from AnyRef

Inherited from Any

Ungrouped