Packages

class EdgeImpl extends This.EdgeBase

Annotations
@SerialVersionUID()
Linear Supertypes
This.EdgeBase, This.InnerEdge, This.InnerEdge, This.InnerElem, This.Edge, Serializable, Iterable[This.NodeT], IterableFactoryDefaults[This.NodeT, Iterable], IterableOps[This.NodeT, Iterable, Iterable[This.NodeT]], IterableOnceOps[This.NodeT, Iterable, Iterable[This.NodeT]], scala.collection.IterableOnce[This.NodeT], InnerEdgeParam[N, E, This.NodeT, E], EdgeParam, OutParam[N, E], Param[N, E], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeImpl
  2. EdgeBase
  3. InnerEdge
  4. InnerEdge
  5. InnerElem
  6. Edge
  7. Serializable
  8. Iterable
  9. IterableFactoryDefaults
  10. IterableOps
  11. IterableOnceOps
  12. IterableOnce
  13. InnerEdgeParam
  14. EdgeParam
  15. OutParam
  16. Param
  17. AnyRef
  18. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by TraversableEnrichments
  4. by anyToNode
  5. by ChainingOps
  6. by IterableEnrichments
  7. by toEdge
  8. by innerEdgeToEdgeCont
  9. by any2stringadd
  10. by StringFormat
  11. by Ensuring
  12. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new EdgeImpl(edge: E[This.NodeT])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toany2stringadd[This.EdgeImpl] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. def ->[B](y: B): (This.EdgeImpl, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toArrowAssoc[This.EdgeImpl] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  10. def adjacents: Set[This.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
    InnerEdge
  11. final def asEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  12. final def asEdgeTProjection[N <: N, E[+X] <: EdgeLikeIn[X]]: GraphBase.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  16. final def coll: EdgeImpl.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  17. def collect[B](pf: PartialFunction[This.NodeT, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  18. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Definition Classes
    IterableOnceOps
  19. def concat[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  20. final def containingGraph: This.ThisGraph

    The Graph instance that contains this inner edge.

    The Graph instance that contains this inner edge.

    Definition Classes
    InnerEdge
  21. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  22. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  23. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  24. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  25. def copyToArray[B >: This.NodeT](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  26. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (This.NodeT, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  27. def count(p: (This.NodeT) => Boolean): Int
    Definition Classes
    IterableOnceOps
  28. def drop(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  29. def dropRight(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableOps
  30. def dropWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  31. val edge: E[This.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
    EdgeImplEdgeBaseInnerEdgeInnerEdgeParam
  32. def empty: Iterable[This.NodeT]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  33. def ensuring(cond: (This.EdgeImpl) => Boolean, msg: => Any): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEnsuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: (This.EdgeImpl) => Boolean): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEnsuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean, msg: => Any): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEnsuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. def ensuring(cond: Boolean): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEnsuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(other: Any): Boolean
    Definition Classes
    InnerEdge → AnyRef → Any
  39. def exists(p: (This.NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  40. def filter(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  41. def filterNot(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def find(p: (This.NodeT) => Boolean): Option[This.NodeT]
    Definition Classes
    IterableOnceOps
  43. def flatMap[B](f: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  44. def flatten[B](implicit asIterable: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  45. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  46. final def fold[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) => T, fb: (GraphBase.EdgeT) => T): T
    Definition Classes
    InnerEdgeParam
  47. def foldLeft[B](z: B)(op: (B, This.NodeT) => B): B
    Definition Classes
    IterableOnceOps
  48. def foldRight[B](z: B)(op: (This.NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  49. def forall(p: (This.NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  50. def foreach[U](f: (This.NodeT) => U): Unit
    Definition Classes
    IterableOnceOps
  51. def fromSpecific(coll: scala.collection.IterableOnce[This.NodeT]): Iterable[This.NodeT]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  52. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  53. def groupBy[K](f: (This.NodeT) => K): Map[K, Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  54. def groupMap[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  55. def groupMapReduce[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  56. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  57. def hasSource[M >: N](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  58. def hasSource[M >: N](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  59. def hasTarget[M >: N](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  60. def hasTarget[M >: N](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  61. def hashCode(): Int
    Definition Classes
    InnerEdge → AnyRef → Any
  62. def head: This.NodeT
    Definition Classes
    IterableOps
  63. def headOption: Option[This.NodeT]
    Definition Classes
    IterableOps
  64. def init: Iterable[This.NodeT]
    Definition Classes
    IterableOps
  65. def inits: Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  66. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  67. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  68. final def isContaining[N <: N, E[+X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
    Definition Classes
    InnerEdgeParam
  69. def isDefined: Boolean
    Definition Classes
    Param
  70. final def isEdge: Boolean
    Definition Classes
    Param
  71. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  72. def isIn: Boolean
    Definition Classes
    OutParamParam
  73. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  74. def isNode: Boolean
    Definition Classes
    EdgeParam
  75. final def isOut: Boolean
    Definition Classes
    Param
  76. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  77. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  78. def iterator: Iterator[This.NodeT]
    Definition Classes
    EdgeBase → IterableOnce
  79. def knownSize: Int
    Definition Classes
    IterableOnce
  80. def last: This.NodeT
    Definition Classes
    IterableOps
  81. def lastOption: Option[This.NodeT]
    Definition Classes
    IterableOps
  82. def lazyZip[B](that: Iterable[B]): LazyZip2[This.NodeT, B, EdgeImpl.this.type]
    Definition Classes
    Iterable
  83. def map[B](f: (This.NodeT) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  84. def matches[M >: N](n1: M, n2: M): Boolean

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  85. def matches[M >: N](n1: M, n2: M): Boolean

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  86. def max[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Definition Classes
    IterableOnceOps
  87. def maxBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    IterableOnceOps
  88. def maxByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Definition Classes
    IterableOnceOps
  89. def maxOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Definition Classes
    IterableOnceOps
  90. def min[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Definition Classes
    IterableOnceOps
  91. def minBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    IterableOnceOps
  92. def minByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Definition Classes
    IterableOnceOps
  93. def minOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Definition Classes
    IterableOnceOps
  94. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  95. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  96. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  97. val n1: This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  98. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  99. def newSpecificBuilder: Builder[This.NodeT, Iterable[This.NodeT]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  100. final def nodes: Iterable[This.NodeT]

    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
    InnerEdge
    Annotations
    @inline()
  101. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  102. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  103. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  104. def partition(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    IterableOps
  105. def partitionMap[A1, A2](f: (This.NodeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  106. def pipe[B](f: (This.EdgeImpl) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toChainingOps[This.EdgeImpl] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  107. def privateNodes: Set[This.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
    InnerEdge
  108. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  109. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  110. def reduce[B >: This.NodeT](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  111. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) => B): B
    Definition Classes
    IterableOnceOps
  112. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) => B): Option[B]
    Definition Classes
    IterableOnceOps
  113. def reduceOption[B >: This.NodeT](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  114. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  115. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  116. def remove: Boolean
  117. def removeWithNodes(edge: E[N]): Boolean
  118. def reversed: Iterable[This.NodeT]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  119. def scan[B >: This.NodeT](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  120. def scanLeft[B](z: B)(op: (B, This.NodeT) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  121. def scanRight[B](z: B)(op: (This.NodeT, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  122. def size: Int
    Definition Classes
    IterableOnceOps
  123. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  124. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  125. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  126. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  127. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  128. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  129. def span(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  130. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  131. def stepper[S <: Stepper[_]](implicit shape: StepperShape[This.NodeT, S]): S
    Definition Classes
    IterableOnce
  132. def stringPrefix: String
    Definition Classes
    EdgeBaseInnerEdge → Iterable → InnerEdgeParam
  133. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  134. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  135. val t: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toTraversableEnrichments[This.NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  136. def tail: Iterable[This.NodeT]
    Definition Classes
    IterableOps
  137. def tails: Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableOps
  138. def take(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  139. def takeRight(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableOps
  140. def takeWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  141. def tap[U](f: (This.EdgeImpl) => U): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toChainingOps[This.EdgeImpl] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  142. def tapEach[U](f: (This.NodeT) => U): Iterable[This.NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  143. def to: This.NodeT

    The head (target node) of a directed edge or _2 otherwise.

    The head (target node) of a directed edge or _2 otherwise.

    Definition Classes
    InnerEdge
  144. def to[C1](factory: Factory[This.NodeT, C1]): C1
    Definition Classes
    IterableOnceOps
  145. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  146. final def toBuffer[B >: This.NodeT]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  147. final def toEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (GraphBase.EdgeT) => GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT
    Definition Classes
    InnerEdgeParam
  148. def toIndexedSeq: IndexedSeq[This.NodeT]
    Definition Classes
    IterableOnceOps
  149. def toList: List[This.NodeT]
    Definition Classes
    IterableOnceOps
  150. def toMSet: MSet[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableEnrichments[This.NodeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Definition Classes
    IterableEnrichments
  151. def toMap[K, V](implicit ev: <:<[This.NodeT, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  152. def toOuter: E[N]

    Reconstructs the outer edge by means of the copy method.

    Reconstructs the outer edge by means of the copy method.

    Definition Classes
    InnerEdge
  153. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[This.NodeT, E]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toTraversableEnrichments[This.NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  154. def toSeq: Seq[This.NodeT]
    Definition Classes
    IterableOnceOps
  155. def toSet[B >: This.NodeT]: Set[B]
    Definition Classes
    IterableOnceOps
  156. def toString(): String
    Definition Classes
    InnerEdgeInnerEdgeParam → Iterable → AnyRef → Any
  157. def toVector: Vector[This.NodeT]
    Definition Classes
    IterableOnceOps
  158. def transpose[B](implicit asIterable: (This.NodeT) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  159. def unzip[A1, A2](implicit asPair: (This.NodeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  160. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  161. val value: This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  162. def view: View[This.NodeT]
    Definition Classes
    IterableOps
  163. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  164. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  165. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  166. def withFilter(p: (This.NodeT) => Boolean): WithFilter[This.NodeT, Iterable]
    Definition Classes
    IterableOps
  167. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[(This.NodeT, B)]
    Definition Classes
    IterableOps
  168. def zipAll[A1 >: This.NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  169. def zipWithIndex: Iterable[(This.NodeT, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  170. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  171. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toEdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  172. final def ~~: Set[This.EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdge
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. final def ++[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).++(suffix)
    Definition Classes
    IterableOps
    Annotations
    @inline()
  2. final def ++[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).++(suffix)
    Definition Classes
    IterableOps
    Annotations
    @inline()
  3. final def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).addString(b)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  4. final def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).addString(b, sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  5. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).addString(b, start, sep, end)
    Definition Classes
    IterableOnceOps
  6. final def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).addString(b)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  7. final def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).addString(b, sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).addString(b, start, sep, end)
    Definition Classes
    IterableOnceOps
  9. final def arity: Int

    Number of nodes linked by this Edge.

    Number of nodes linked by this Edge. At least two nodes are linked. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).arity
    Definition Classes
    EdgeLike
  10. final def arity: Int

    Number of nodes linked by this Edge.

    Number of nodes linked by this Edge. At least two nodes are linked. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).arity
    Definition Classes
    EdgeLike
  11. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).canEqual(that)
    Definition Classes
    EdgeLikeEq
  12. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).canEqual(that)
    Definition Classes
    EdgeLikeEq
  13. def collect[B](pf: PartialFunction[This.NodeT, B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).collect(pf)
    Definition Classes
    IterableOps → IterableOnceOps
  14. def collect[B](pf: PartialFunction[This.NodeT, B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).collect(pf)
    Definition Classes
    IterableOps → IterableOnceOps
  15. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).collectFirst(pf)
    Definition Classes
    IterableOnceOps
  16. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).collectFirst(pf)
    Definition Classes
    IterableOnceOps
  17. def concat[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).concat(suffix)
    Definition Classes
    IterableOps
  18. def concat[B >: This.NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).concat(suffix)
    Definition Classes
    IterableOps
  19. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs, start, len)
    Definition Classes
    IterableOnceOps
  20. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs, start)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  21. def copyToArray[B >: This.NodeT](xs: Array[B]): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  22. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs, start, len)
    Definition Classes
    IterableOnceOps
  23. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs, start)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  24. def copyToArray[B >: This.NodeT](xs: Array[B]): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).copyToArray(xs)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  25. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (This.NodeT, B) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).corresponds(that)(p)
    Definition Classes
    IterableOnceOps
  26. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (This.NodeT, B) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).corresponds(that)(p)
    Definition Classes
    IterableOnceOps
  27. def count(p: (This.NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).count(p)
    Definition Classes
    IterableOnceOps
  28. def count(p: (This.NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).count(p)
    Definition Classes
    IterableOnceOps
  29. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).directed
    Definition Classes
    EdgeLike
  30. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).directed
    Definition Classes
    EdgeLike
  31. def drop(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).drop(n)
    Definition Classes
    IterableOps → IterableOnceOps
  32. def drop(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).drop(n)
    Definition Classes
    IterableOps → IterableOnceOps
  33. def dropRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).dropRight(n)
    Definition Classes
    IterableOps
  34. def dropRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).dropRight(n)
    Definition Classes
    IterableOps
  35. def dropWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).dropWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  36. def dropWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).dropWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  37. def edge: EdgeLike[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).edge
    Definition Classes
    OuterEdge
  38. def edge: EdgeLike[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).edge
    Definition Classes
    OuterEdge
  39. def empty: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).empty
    Definition Classes
    IterableFactoryDefaults → IterableOps
  40. def empty: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).empty
    Definition Classes
    IterableFactoryDefaults → IterableOps
  41. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).equals(other)
    Definition Classes
    EdgeLike → AnyRef → Any
  42. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).equals(other)
    Definition Classes
    EdgeLike → AnyRef → Any
  43. def exists(p: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).exists(p)
    Definition Classes
    IterableOnceOps
  44. def exists(p: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).exists(p)
    Definition Classes
    IterableOnceOps
  45. def filter(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).filter(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  46. def filter(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).filter(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  47. def filterNot(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).filterNot(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  48. def filterNot(pred: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).filterNot(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  49. def find(p: (This.NodeT) => Boolean): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).find(p)
    Definition Classes
    IterableOnceOps
  50. def find(p: (This.NodeT) => Boolean): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).find(p)
    Definition Classes
    IterableOnceOps
  51. def flatMap[B](f: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).flatMap(f)
    Definition Classes
    IterableOps → IterableOnceOps
  52. def flatMap[B](f: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).flatMap(f)
    Definition Classes
    IterableOps → IterableOnceOps
  53. def flatten[B](implicit asIterable: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).flatten(asIterable)
    Definition Classes
    IterableOps → IterableOnceOps
  54. def flatten[B](implicit asIterable: (This.NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).flatten(asIterable)
    Definition Classes
    IterableOps → IterableOnceOps
  55. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceOps
  56. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceOps
  57. def foldLeft[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceOps
  58. def foldLeft[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceOps
  59. def foldRight[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceOps
  60. def foldRight[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceOps
  61. def forall(p: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).forall(p)
    Definition Classes
    IterableOnceOps
  62. def forall(p: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).forall(p)
    Definition Classes
    IterableOnceOps
  63. def foreach[U](f: (This.NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).foreach(f)
    Definition Classes
    IterableOnceOps
  64. def foreach[U](f: (This.NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).foreach(f)
    Definition Classes
    IterableOnceOps
  65. def groupBy[K](f: (This.NodeT) => K): Map[K, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).groupBy(f)
    Definition Classes
    IterableOps
  66. def groupBy[K](f: (This.NodeT) => K): Map[K, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).groupBy(f)
    Definition Classes
    IterableOps
  67. def groupMap[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B): Map[K, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).groupMap(key)(f)
    Definition Classes
    IterableOps
  68. def groupMap[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B): Map[K, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).groupMap(key)(f)
    Definition Classes
    IterableOps
  69. def groupMapReduce[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).groupMapReduce(key)(f)(reduce)
    Definition Classes
    IterableOps
  70. def groupMapReduce[K, B](key: (This.NodeT) => K)(f: (This.NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).groupMapReduce(key)(f)(reduce)
    Definition Classes
    IterableOps
  71. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).grouped(size)
    Definition Classes
    IterableOps
  72. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).grouped(size)
    Definition Classes
    IterableOps
  73. def hasSource(pred: (This.NodeT) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).hasSource(pred)
    Definition Classes
    EdgeLike
  74. def hasSource(pred: (This.NodeT) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).hasSource(pred)
    Definition Classes
    EdgeLike
  75. def hasTarget(pred: (This.NodeT) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).hasTarget(pred)
    Definition Classes
    EdgeLike
  76. def hasTarget(pred: (This.NodeT) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).hasTarget(pred)
    Definition Classes
    EdgeLike
  77. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).hashCode()
    Definition Classes
    EdgeLike → AnyRef → Any
  78. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).hashCode()
    Definition Classes
    EdgeLike → AnyRef → Any
  79. def head: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).head
    Definition Classes
    IterableOps
  80. def head: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).head
    Definition Classes
    IterableOps
  81. def headOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).headOption
    Definition Classes
    IterableOps
  82. def headOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).headOption
    Definition Classes
    IterableOps
  83. def init: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).init
    Definition Classes
    IterableOps
  84. def init: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).init
    Definition Classes
    IterableOps
  85. def inits: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).inits
    Definition Classes
    IterableOps
  86. def inits: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).inits
    Definition Classes
    IterableOps
  87. def isAt(pred: (This.NodeT) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isAt(pred)
    Definition Classes
    EdgeLike
  88. def isAt(pred: (This.NodeT) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isAt(pred)
    Definition Classes
    EdgeLike
  89. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).isDefined
    Definition Classes
    Param
  90. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isDefined
    Definition Classes
    Param
  91. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isDefined
    Definition Classes
    Param
  92. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isDirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  93. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isDirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  94. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).isEdge
    Definition Classes
    Param
  95. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isEdge
    Definition Classes
    Param
  96. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isEdge
    Definition Classes
    Param
  97. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isEmpty
    Definition Classes
    IterableOnceOps
  98. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isEmpty
    Definition Classes
    IterableOnceOps
  99. def isHyperEdge: Boolean

    true if this is a hyperedge that is it may have more than two ends.

    true if this is a hyperedge that is it may have more than two ends.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isHyperEdge
    Definition Classes
    EdgeLike
  100. def isHyperEdge: Boolean

    true if this is a hyperedge that is it may have more than two ends.

    true if this is a hyperedge that is it may have more than two ends.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isHyperEdge
    Definition Classes
    EdgeLike
  101. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).isIn
    Definition Classes
    InParamParam
  102. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isIn
    Definition Classes
    InParamParam
  103. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isIn
    Definition Classes
    InParamParam
  104. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isLabeled
    Definition Classes
    EdgeLike
  105. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isLabeled
    Definition Classes
    EdgeLike
  106. def isLooping: Boolean

    true if this edge produces a self-loop.

    true if this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if the source is equal to any of the targets. In case of an undirected hyperedge, a loop is given if any pair of incident nodes has equal nodes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isLooping
    Definition Classes
    EdgeLike
  107. def isLooping: Boolean

    true if this edge produces a self-loop.

    true if this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if the source is equal to any of the targets. In case of an undirected hyperedge, a loop is given if any pair of incident nodes has equal nodes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isLooping
    Definition Classes
    EdgeLike
  108. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).isNode
    Definition Classes
    NodeParam
  109. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isNode
    Definition Classes
    EdgeParam
  110. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isNode
    Definition Classes
    EdgeParam
  111. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).isOut
    Definition Classes
    Param
  112. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isOut
    Definition Classes
    Param
  113. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isOut
    Definition Classes
    Param
  114. def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).isTraversableAgain
    Definition Classes
    IterableOps → IterableOnceOps
  115. def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).isTraversableAgain
    Definition Classes
    IterableOps → IterableOnceOps
  116. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isUndirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  117. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).isUndirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  118. def iterableFactory: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).iterableFactory
    Definition Classes
    Iterable → IterableOps
  119. def iterableFactory: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).iterableFactory
    Definition Classes
    Iterable → IterableOps
  120. def iterator: Iterator[This.NodeT]

    Iterator for the nodes (end-points) of this edge.

    Iterator for the nodes (end-points) of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).iterator
    Definition Classes
    EdgeLike → IterableOnce
  121. def iterator: Iterator[This.NodeT]

    Iterator for the nodes (end-points) of this edge.

    Iterator for the nodes (end-points) of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).iterator
    Definition Classes
    EdgeLike → IterableOnce
  122. def knownSize: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).knownSize
    Definition Classes
    IterableOnce
  123. def knownSize: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).knownSize
    Definition Classes
    IterableOnce
  124. def label: Any

    The label of this edge.

    The label of this edge. If Graph's edge type parameter has been inferred or set to a labeled edge type all contained edges are labeled. Otherwise you should assert, for instance by calling isLabeled, that the edge instance is labeled before calling this method.

    Note that label is normally not part of the edge key (hashCode). As a result, edges with different labels connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different labels you should either make use of a predefined key-labeled edge type such as LDiEdge or define a custom edge class that mixes in ExtendedKey and adds label to keyAttributes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).label
    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  125. def label: Any

    The label of this edge.

    The label of this edge. If Graph's edge type parameter has been inferred or set to a labeled edge type all contained edges are labeled. Otherwise you should assert, for instance by calling isLabeled, that the edge instance is labeled before calling this method.

    Note that label is normally not part of the edge key (hashCode). As a result, edges with different labels connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different labels you should either make use of a predefined key-labeled edge type such as LDiEdge or define a custom edge class that mixes in ExtendedKey and adds label to keyAttributes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).label
    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  126. def last: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).last
    Definition Classes
    IterableOps
  127. def last: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).last
    Definition Classes
    IterableOps
  128. def lastOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).lastOption
    Definition Classes
    IterableOps
  129. def lastOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).lastOption
    Definition Classes
    IterableOps
  130. def lazyZip[B]: ([B](that: Iterable[B]): scala.collection.LazyZip2[AdjacencyListGraph.this.NodeT,B,_1.type]) forSome {val _1: E[This.NodeT]}
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).lazyZip
    Definition Classes
    Iterable
  131. def lazyZip[B]: ([B](that: Iterable[B]): scala.collection.LazyZip2[AdjacencyListGraph.this.NodeT,B,_1.type]) forSome {val _1: E[This.NodeT]}
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).lazyZip
    Definition Classes
    Iterable
  132. def map[B](f: (This.NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).map(f)
    Definition Classes
    IterableOps → IterableOnceOps
  133. def map[B](f: (This.NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).map(f)
    Definition Classes
    IterableOps → IterableOnceOps
  134. def matches(p1: (This.NodeT) => Boolean, p2: (This.NodeT) => Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).matches(p1, p2)
    Definition Classes
    EdgeLike
  135. def matches(p1: (This.NodeT) => Boolean, p2: (This.NodeT) => Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).matches(p1, p2)
    Definition Classes
    EdgeLike
  136. def max[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).max(ord)
    Definition Classes
    IterableOnceOps
  137. def max[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).max(ord)
    Definition Classes
    IterableOnceOps
  138. def maxBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  139. def maxBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  140. def maxByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).maxByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  141. def maxByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).maxByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  142. def maxOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).maxOption(ord)
    Definition Classes
    IterableOnceOps
  143. def maxOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).maxOption(ord)
    Definition Classes
    IterableOnceOps
  144. def min[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).min(ord)
    Definition Classes
    IterableOnceOps
  145. def min[B >: This.NodeT](implicit ord: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).min(ord)
    Definition Classes
    IterableOnceOps
  146. def minBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  147. def minBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  148. def minByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).minByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  149. def minByOption[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).minByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  150. def minOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).minOption(ord)
    Definition Classes
    IterableOnceOps
  151. def minOption[B >: This.NodeT](implicit ord: Ordering[B]): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).minOption(ord)
    Definition Classes
    IterableOnceOps
  152. final def mkString: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).mkString
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  153. final def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).mkString(sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  154. final def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceOps
  155. final def mkString: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).mkString
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  156. final def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).mkString(sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  157. final def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceOps
  158. def nodeSeq: Seq[This.NodeT]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nodeSeq
    Definition Classes
    EdgeLike
  159. def nodeSeq: Seq[This.NodeT]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nodeSeq
    Definition Classes
    EdgeLike
  160. def nodes: Product

    The end nodes joined by this edge.

    The end nodes joined by this edge.

    Nodes will typically be represented by Tuples. Alternatively subclasses of Iterable implementing Product, such as List, may also be used. In the latter case be aware of higher memory footprint.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).nodes
    Definition Classes
    EdgeLike
  161. def nodes: Product

    The end nodes joined by this edge.

    The end nodes joined by this edge.

    Nodes will typically be represented by Tuples. Alternatively subclasses of Iterable implementing Product, such as List, may also be used. In the latter case be aware of higher memory footprint.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).nodes
    Definition Classes
    EdgeLike
  162. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).nonEmpty
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  163. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).nonEmpty
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  164. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nonHyperEdge
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  165. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nonHyperEdge
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  166. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nonLooping
    Definition Classes
    EdgeLike
  167. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).nonLooping
    Definition Classes
    EdgeLike
  168. def partition(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).partition(p)
    Definition Classes
    IterableOps
  169. def partition(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).partition(p)
    Definition Classes
    IterableOps
  170. def partitionMap[A1, A2](f: (This.NodeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).partitionMap(f)
    Definition Classes
    IterableOps
  171. def partitionMap[A1, A2](f: (This.NodeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).partitionMap(f)
    Definition Classes
    IterableOps
  172. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).product(num)
    Definition Classes
    IterableOnceOps
  173. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).product(num)
    Definition Classes
    IterableOnceOps
  174. def reduce[B >: This.NodeT](op: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduce(op)
    Definition Classes
    IterableOnceOps
  175. def reduce[B >: This.NodeT](op: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduce(op)
    Definition Classes
    IterableOnceOps
  176. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduceLeft(op)
    Definition Classes
    IterableOnceOps
  177. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduceLeft(op)
    Definition Classes
    IterableOnceOps
  178. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduceLeftOption(op)
    Definition Classes
    IterableOnceOps
  179. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduceLeftOption(op)
    Definition Classes
    IterableOnceOps
  180. def reduceOption[B >: This.NodeT](op: (B, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduceOption(op)
    Definition Classes
    IterableOnceOps
  181. def reduceOption[B >: This.NodeT](op: (B, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduceOption(op)
    Definition Classes
    IterableOnceOps
  182. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduceRight(op)
    Definition Classes
    IterableOnceOps
  183. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduceRight(op)
    Definition Classes
    IterableOnceOps
  184. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).reduceRightOption(op)
    Definition Classes
    IterableOnceOps
  185. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).reduceRightOption(op)
    Definition Classes
    IterableOnceOps
  186. def scan[B >: This.NodeT](z: B)(op: (B, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).scan(z)(op)
    Definition Classes
    IterableOps
  187. def scan[B >: This.NodeT](z: B)(op: (B, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).scan(z)(op)
    Definition Classes
    IterableOps
  188. def scanLeft[B](z: B)(op: (B, This.NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).scanLeft(z)(op)
    Definition Classes
    IterableOps → IterableOnceOps
  189. def scanLeft[B](z: B)(op: (B, This.NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).scanLeft(z)(op)
    Definition Classes
    IterableOps → IterableOnceOps
  190. def scanRight[B](z: B)(op: (This.NodeT, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).scanRight(z)(op)
    Definition Classes
    IterableOps
  191. def scanRight[B](z: B)(op: (This.NodeT, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).scanRight(z)(op)
    Definition Classes
    IterableOps
  192. val self: This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toChainingOps[This.EdgeImpl] performed by method ChainingOps in scalax.collection.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: ChainingOps[This.EdgeImpl]).self
    Definition Classes
    ChainingOps
  193. val self: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableEnrichments[This.NodeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: IterableEnrichments[This.NodeT]).self
    Definition Classes
    IterableEnrichments
  194. def size: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).size
    Definition Classes
    IterableOnceOps
  195. def size: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).size
    Definition Classes
    IterableOnceOps
  196. def sizeCompare(that: Iterable[_]): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sizeCompare(that)
    Definition Classes
    IterableOps
  197. def sizeCompare(otherSize: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sizeCompare(otherSize)
    Definition Classes
    IterableOps
  198. def sizeCompare(that: Iterable[_]): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sizeCompare(that)
    Definition Classes
    IterableOps
  199. def sizeCompare(otherSize: Int): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sizeCompare(otherSize)
    Definition Classes
    IterableOps
  200. final def sizeIs: SizeCompareOps
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sizeIs
    Definition Classes
    IterableOps
    Annotations
    @inline()
  201. final def sizeIs: SizeCompareOps
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sizeIs
    Definition Classes
    IterableOps
    Annotations
    @inline()
  202. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).slice(from, until)
    Definition Classes
    IterableOps → IterableOnceOps
  203. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).slice(from, until)
    Definition Classes
    IterableOps → IterableOnceOps
  204. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sliding(size, step)
    Definition Classes
    IterableOps
  205. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sliding(size)
    Definition Classes
    IterableOps
  206. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sliding(size, step)
    Definition Classes
    IterableOps
  207. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sliding(size)
    Definition Classes
    IterableOps
  208. def sources: Iterable[This.NodeT]

    All source ends of this edge.

    All source ends of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).sources
    Definition Classes
    EdgeLike
  209. def sources: Iterable[This.NodeT]

    All source ends of this edge.

    All source ends of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).sources
    Definition Classes
    EdgeLike
  210. def span(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).span(p)
    Definition Classes
    IterableOps → IterableOnceOps
  211. def span(p: (This.NodeT) => Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).span(p)
    Definition Classes
    IterableOps → IterableOnceOps
  212. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).splitAt(n)
    Definition Classes
    IterableOps → IterableOnceOps
  213. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).splitAt(n)
    Definition Classes
    IterableOps → IterableOnceOps
  214. def stepper[S <: Stepper[_]](implicit shape: StepperShape[This.NodeT, S]): S
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).stepper(shape)
    Definition Classes
    IterableOnce
  215. def stepper[S <: Stepper[_]](implicit shape: StepperShape[This.NodeT, S]): S
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).stepper(shape)
    Definition Classes
    IterableOnce
  216. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).stringPrefix
    Definition Classes
    NodeParam
  217. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).stringPrefix
    Definition Classes
    EdgeLike → Iterable
  218. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).stringPrefix
    Definition Classes
    EdgeLike → Iterable
  219. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).sum(num)
    Definition Classes
    IterableOnceOps
  220. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).sum(num)
    Definition Classes
    IterableOnceOps
  221. def tail: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).tail
    Definition Classes
    IterableOps
  222. def tail: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).tail
    Definition Classes
    IterableOps
  223. def tails: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).tails
    Definition Classes
    IterableOps
  224. def tails: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).tails
    Definition Classes
    IterableOps
  225. def take(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).take(n)
    Definition Classes
    IterableOps → IterableOnceOps
  226. def take(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).take(n)
    Definition Classes
    IterableOps → IterableOnceOps
  227. def takeRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).takeRight(n)
    Definition Classes
    IterableOps
  228. def takeRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).takeRight(n)
    Definition Classes
    IterableOps
  229. def takeWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).takeWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  230. def takeWhile(p: (This.NodeT) => Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).takeWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  231. def tapEach[U](f: (This.NodeT) => U): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).tapEach(f)
    Definition Classes
    IterableOps → IterableOnceOps
  232. def tapEach[U](f: (This.NodeT) => U): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).tapEach(f)
    Definition Classes
    IterableOps → IterableOnceOps
  233. def targets: Iterable[This.NodeT]

    All target ends of this edge.

    All target ends of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).targets
    Definition Classes
    EdgeLike
  234. def targets: Iterable[This.NodeT]

    All target ends of this edge.

    All target ends of this edge.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).targets
    Definition Classes
    EdgeLike
  235. def to[C1](factory: Factory[This.NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).to(factory)
    Definition Classes
    IterableOnceOps
  236. def to[C1](factory: Factory[This.NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).to(factory)
    Definition Classes
    IterableOnceOps
  237. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceOps
  238. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceOps
  239. final def toBuffer[B >: This.NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toBuffer
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  240. final def toBuffer[B >: This.NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toBuffer
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  241. def toIndexedSeq: IndexedSeq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceOps
  242. def toIndexedSeq: IndexedSeq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceOps
  243. def toList: List[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toList
    Definition Classes
    IterableOnceOps
  244. def toList: List[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toList
    Definition Classes
    IterableOnceOps
  245. def toMap[K, V](implicit ev: <:<[This.NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toMap(ev)
    Definition Classes
    IterableOnceOps
  246. def toMap[K, V](implicit ev: <:<[This.NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toMap(ev)
    Definition Classes
    IterableOnceOps
  247. def toSeq: Seq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toSeq
    Definition Classes
    IterableOnceOps
  248. def toSeq: Seq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toSeq
    Definition Classes
    IterableOnceOps
  249. def toSet[B >: This.NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toSet
    Definition Classes
    IterableOnceOps
  250. def toSet[B >: This.NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toSet
    Definition Classes
    IterableOnceOps
  251. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toOuterNode[This.EdgeImpl] 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:
    (edgeImpl: OuterNode[This.EdgeImpl]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  252. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toString()
    Definition Classes
    EdgeLike → Iterable → AnyRef → Any
  253. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toString()
    Definition Classes
    EdgeLike → Iterable → AnyRef → Any
  254. def toVector: Vector[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toVector
    Definition Classes
    IterableOnceOps
  255. def toVector: Vector[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toVector
    Definition Classes
    IterableOnceOps
  256. def transpose[B](implicit asIterable: (This.NodeT) => Iterable[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).transpose(asIterable)
    Definition Classes
    IterableOps
  257. def transpose[B](implicit asIterable: (This.NodeT) => Iterable[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).transpose(asIterable)
    Definition Classes
    IterableOps
  258. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).undirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  259. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).undirected
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  260. def unzip[A1, A2](implicit asPair: (This.NodeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).unzip(asPair)
    Definition Classes
    IterableOps
  261. def unzip[A1, A2](implicit asPair: (This.NodeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).unzip(asPair)
    Definition Classes
    IterableOps
  262. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).unzip3(asTriple)
    Definition Classes
    IterableOps
  263. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).unzip3(asTriple)
    Definition Classes
    IterableOps
  264. def view: View[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).view
    Definition Classes
    IterableOps
  265. def view: View[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).view
    Definition Classes
    IterableOps
  266. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should either make use of a predefined key-weighted edge type such as WDiEdge or define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).weight
    Definition Classes
    EdgeLike
  267. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should either make use of a predefined key-weighted edge type such as WDiEdge or define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).weight
    Definition Classes
    EdgeLike
  268. def withFilter(p: (This.NodeT) => Boolean): WithFilter[This.NodeT, Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).withFilter(p)
    Definition Classes
    IterableOps
  269. def withFilter(p: (This.NodeT) => Boolean): WithFilter[This.NodeT, Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).withFilter(p)
    Definition Classes
    IterableOps
  270. def withSources[U](f: (This.NodeT) => U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).withSources(f)
    Definition Classes
    EdgeLike
  271. def withSources[U](f: (This.NodeT) => U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).withSources(f)
    Definition Classes
    EdgeLike
  272. def withTargets[U](f: (This.NodeT) => U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).withTargets(f)
    Definition Classes
    EdgeLike
  273. def withTargets[U](f: (This.NodeT) => U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (edgeImpl: E[This.NodeT]).withTargets(f)
    Definition Classes
    EdgeLike
  274. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[(This.NodeT, B)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).zip(that)
    Definition Classes
    IterableOps
  275. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[(This.NodeT, B)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).zip(that)
    Definition Classes
    IterableOps
  276. def zipAll[A1 >: This.NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).zipAll(that, thisElem, thatElem)
    Definition Classes
    IterableOps
  277. def zipAll[A1 >: This.NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).zipAll(that, thisElem, thatElem)
    Definition Classes
    IterableOps
  278. def zipWithIndex: Iterable[(This.NodeT, Int)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).zipWithIndex
    Definition Classes
    IterableOps → IterableOnceOps
  279. def zipWithIndex: Iterable[(This.NodeT, Int)]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).zipWithIndex
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: This.NodeT](that: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).++:(that)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. def ++:[B >: This.NodeT](that: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).++:(that)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  3. def ++:[B >: This.NodeT](that: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  4. def /:[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  5. final def /:[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT])./:(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  6. final def /:[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT])./:(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  7. final def /:[B](z: B)(op: (B, This.NodeT) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  8. def :\[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  9. final def :\[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  10. final def :\[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  11. final def :\[B](z: B)(op: (This.NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  12. def aggregate[B](z: => B)(seqop: (B, This.NodeT) => B, combop: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).aggregate(z)(seqop, combop)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  13. def aggregate[B](z: => B)(seqop: (B, This.NodeT) => B, combop: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).aggregate(z)(seqop, combop)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  14. def aggregate[B](z: => B)(seqop: (B, This.NodeT) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  15. def collectFirst[B](f: PartialFunction[This.NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  16. def companion: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).companion
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  17. def companion: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).companion
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  18. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  19. def copyToBuffer(dest: Buffer[This.NodeT]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  20. final def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  21. final def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  22. final def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  23. def count(f: (This.NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  24. def exists(f: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  25. def filter(f: (This.NodeT) => Boolean): Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  26. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  27. def find(p: (This.NodeT) => Boolean): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  28. def flatMap[B](f: (This.NodeT) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  29. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  30. def foldLeft[B](z: B)(op: (B, This.NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  31. def foldRight[B](z: B)(op: (This.NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  32. def forall(f: (This.NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  33. def foreach[U](f: (This.NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  34. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toStringFormat[This.EdgeImpl] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  35. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).hasDefiniteSize
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  36. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).hasDefiniteSize
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  37. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  38. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  39. def map[B](f: (This.NodeT) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  40. def max(implicit ord: Ordering[This.NodeT]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  41. def maxBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  42. def min(implicit ord: Ordering[This.NodeT]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  43. def minBy[B](f: (This.NodeT) => B)(implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  44. def mkString: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  45. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  46. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  47. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  48. def product(implicit num: Numeric[This.NodeT]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  49. def reduce(f: (This.NodeT, This.NodeT) => This.NodeT): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  50. def reduceLeft(f: (This.NodeT, This.NodeT) => This.NodeT): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  51. def reduceLeftOption(f: (This.NodeT, This.NodeT) => This.NodeT): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  52. def reduceOption(f: (This.NodeT, This.NodeT) => This.NodeT): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  53. def reduceRight(f: (This.NodeT, This.NodeT) => This.NodeT): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  54. def reduceRightOption(f: (This.NodeT, This.NodeT) => This.NodeT): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  55. final def repr: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).repr
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  56. final def repr: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).repr
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  57. final def repr: Iterable[This.NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

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

    (Since version 2.13.0) Use .iterator.sameElements instead

  59. def seq: E[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).seq
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  60. def seq: E[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).seq
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  61. def seq: EdgeImpl.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  62. def size: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  63. def sum(implicit num: Numeric[This.NodeT]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  64. def to[C1](factory: Factory[This.NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  65. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  66. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  67. def toEdgeIn: E[N]
    Definition Classes
    InnerEdge
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

  68. def toIndexedSeq: IndexedSeq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  69. final def toIterable: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  70. final def toIterable: E[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toIterable
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  71. final def toIterable: E[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toIterable
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  72. final def toIterable: EdgeImpl.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  73. def toIterator: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  74. final def toIterator: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toIterator
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  75. final def toIterator: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toIterator
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  76. final def toIterator: Iterator[This.NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  77. def toList: List[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  78. def toMap[K, V](implicit ev: <:<[This.NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  79. def toSeq: Seq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  80. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  81. def toStream: Stream[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  82. final def toStream: Stream[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toStream
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  83. final def toStream: Stream[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toStream
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  84. final def toStream: Stream[This.NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  85. final def toTraversable: Traversable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  86. final def toTraversable: Traversable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).toTraversable
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  87. final def toTraversable: Traversable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).toTraversable
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  88. final def toTraversable: Traversable[This.NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  89. def toVector: Vector[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  90. def view(from: Int, until: Int): View[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    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:
    (edgeImpl: E[This.NodeT]).view(from, until)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

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

  91. def view(from: Int, until: Int): View[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toE[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    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:
    (edgeImpl: E[This.NodeT]).view(from, until)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

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

  92. def view(from: Int, until: Int): View[This.NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

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

  93. def withFilter(f: (This.NodeT) => Boolean): Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toIterableOnceExtensionMethods[This.NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: IterableOnceExtensionMethods[This.NodeT]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  94. def [B](y: B): (This.EdgeImpl, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl toArrowAssoc[This.EdgeImpl] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from This.EdgeBase

Inherited from This.InnerEdge

Inherited from This.InnerEdge

Inherited from This.InnerElem

Inherited from This.Edge

Inherited from Serializable

Inherited from Iterable[This.NodeT]

Inherited from IterableFactoryDefaults[This.NodeT, Iterable]

Inherited from IterableOps[This.NodeT, Iterable, Iterable[This.NodeT]]

Inherited from IterableOnceOps[This.NodeT, Iterable, Iterable[This.NodeT]]

Inherited from scala.collection.IterableOnce[This.NodeT]

Inherited from InnerEdgeParam[N, E, This.NodeT, E]

Inherited from EdgeParam

Inherited from OutParam[N, E]

Inherited from Param[N, E]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromThis.EdgeImpl to IterableOnceExtensionMethods[This.NodeT]

Inherited by implicit conversion EdgeAssoc fromThis.EdgeImpl to EdgeAssoc[This.EdgeImpl]

Inherited by implicit conversion TraversableEnrichments fromThis.EdgeImpl to TraversableEnrichments[This.NodeT, Iterable]

Inherited by implicit conversion anyToNode fromThis.EdgeImpl to OuterNode[This.EdgeImpl]

Inherited by implicit conversion ChainingOps fromThis.EdgeImpl to ChainingOps[This.EdgeImpl]

Inherited by implicit conversion IterableEnrichments fromThis.EdgeImpl to IterableEnrichments[This.NodeT]

Inherited by implicit conversion toEdge fromThis.EdgeImpl to E[This.NodeT]

Inherited by implicit conversion innerEdgeToEdgeCont fromThis.EdgeImpl to E[This.NodeT]

Inherited by implicit conversion any2stringadd fromThis.EdgeImpl to any2stringadd[This.EdgeImpl]

Inherited by implicit conversion StringFormat fromThis.EdgeImpl to StringFormat[This.EdgeImpl]

Inherited by implicit conversion Ensuring fromThis.EdgeImpl to Ensuring[This.EdgeImpl]

Inherited by implicit conversion ArrowAssoc fromThis.EdgeImpl to ArrowAssoc[This.EdgeImpl]

Ungrouped