Packages

class EdgeImpl extends This.EdgeBase

Annotations
@SerialVersionUID()
Linear Supertypes
This.EdgeBase, This.InnerEdge, This.InnerEdge, This.InnerElem, This.Edge, Serializable, Serializable, Iterable[This.NodeT], IterableLike[This.NodeT, Iterable[This.NodeT]], Equals, GenIterable[This.NodeT], GenIterableLike[This.NodeT, Iterable[This.NodeT]], Traversable[This.NodeT], GenTraversable[This.NodeT], GenericTraversableTemplate[This.NodeT, Iterable], TraversableLike[This.NodeT, Iterable[This.NodeT]], GenTraversableLike[This.NodeT, Iterable[This.NodeT]], Parallelizable[This.NodeT, ParIterable[This.NodeT]], TraversableOnce[This.NodeT], GenTraversableOnce[This.NodeT], FilterMonadic[This.NodeT, Iterable[This.NodeT]], HasNewBuilder[This.NodeT, Iterable[This.NodeT]], InnerEdgeParam[N, E, This.NodeT, E], EdgeParam, OutParam[N, E], Param[N, E], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeImpl
  2. EdgeBase
  3. InnerEdge
  4. InnerEdge
  5. InnerElem
  6. Edge
  7. Serializable
  8. Serializable
  9. Iterable
  10. IterableLike
  11. Equals
  12. GenIterable
  13. GenIterableLike
  14. Traversable
  15. GenTraversable
  16. GenericTraversableTemplate
  17. TraversableLike
  18. GenTraversableLike
  19. Parallelizable
  20. TraversableOnce
  21. GenTraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. InnerEdgeParam
  25. EdgeParam
  26. OutParam
  27. Param
  28. AnyRef
  29. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by toEdge
  7. by innerEdgeToEdgeCont
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. type Self = Iterable[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

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 to any2stringadd[This.EdgeImpl] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (This.EdgeImpl, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to ArrowAssoc[This.EdgeImpl] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def adjacents: Set[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
  15. def aggregate[B](z: ⇒ B)(seqop: (B, This.NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. final def asEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam
  17. final def asEdgeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.EdgeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam
  18. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  19. def canEqual(that: Any): Boolean
    Definition Classes
    InnerEdge → IterableLike → Equals
  20. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  21. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  22. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  23. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  24. final def containingGraph: This.ThisGraph

    The Graph instance that contains this inner edge.

    The Graph instance that contains this inner edge.

    Definition Classes
    InnerEdge
  25. 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 to E[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  26. 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 to E[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  27. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  28. def copyToArray[B >: This.NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  31. def count(p: (This.NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def drop(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  33. def dropRight(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableLike
  34. def dropWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  35. 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
    EdgeImpl → EdgeBase → InnerEdge → InnerEdgeParam
  36. def ensuring(cond: (This.EdgeImpl) ⇒ Boolean, msg: ⇒ Any): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to Ensuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. def ensuring(cond: (This.EdgeImpl) ⇒ Boolean): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to Ensuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  38. def ensuring(cond: Boolean, msg: ⇒ Any): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to Ensuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  39. def ensuring(cond: Boolean): This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to Ensuring[This.EdgeImpl] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  41. def equals(other: Any): Boolean
    Definition Classes
    InnerEdge → Equals → AnyRef → Any
  42. def exists(p: (This.NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def filter(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def filterNot(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  46. def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  48. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  49. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) ⇒ T, fb: (GraphBase.EdgeT) ⇒ T): T
    Definition Classes
    InnerEdgeParam
  51. def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  53. def forall(p: (This.NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def foreach[U](f: (This.NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  55. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to StringFormat[This.EdgeImpl] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  56. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  57. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Iterable[This.NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableLike
  60. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  61. 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 to E[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  62. 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 to E[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  63. 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 to E[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  64. 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 to E[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  65. def hashCode(): Int
    Definition Classes
    InnerEdge → AnyRef → Any
  66. def head: This.NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  67. def headOption: Option[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def init: Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def inits: Iterator[Iterable[This.NodeT]]
    Definition Classes
    TraversableLike
  70. 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 to E[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  71. 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 to E[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  72. final def isContaining[N <: N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
    Definition Classes
    InnerEdgeParam
  73. def isDefined: Boolean
    Definition Classes
    Param
  74. def isEdge: Boolean
    Definition Classes
    EdgeParam
  75. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  76. def isIn: Boolean
    Definition Classes
    OutParam → Param
  77. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  78. def isNode: Boolean
    Definition Classes
    EdgeParam
  79. def isOut: Boolean
    Definition Classes
    OutParam → Param
  80. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. def iterator: Iterator[This.NodeT]
    Definition Classes
    EdgeBase → IterableLike → GenIterableLike
  82. def last: This.NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def lastOption: Option[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  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 to E[This.NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  86. 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 to E[This.NodeT] performed by method innerEdgeToEdgeCont in scalax.collection.GraphBase.Edge.
    Definition Classes
    EdgeLike
  87. def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def maxBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def minBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. val n1: This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to EdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  95. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  96. def newBuilder: Builder[This.NodeT, Iterable[This.NodeT]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  97. 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()
  98. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  100. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  101. def par: ParIterable[This.NodeT]
    Definition Classes
    Parallelizable
  102. def parCombiner: Combiner[This.NodeT, ParIterable[This.NodeT]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  103. def partition(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  104. 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
  105. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  108. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  111. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def remove: Boolean
  113. def removeWithNodes(edge: E[N]): Boolean
  114. def repr: Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def reversed: List[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  116. def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  117. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  120. def seq: Iterable[This.NodeT]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  121. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  123. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  124. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableLike
  125. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Definition Classes
    IterableLike
  126. def span(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def stringPrefix: String
    Definition Classes
    EdgeBase → InnerEdge → TraversableLike → GenTraversableLike → InnerEdgeParam
  129. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  131. def tail: Iterable[This.NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def tails: Iterator[Iterable[This.NodeT]]
    Definition Classes
    TraversableLike
  133. def take(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  134. def takeRight(n: Int): Iterable[This.NodeT]
    Definition Classes
    IterableLike
  135. def takeWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  136. def thisCollection: Iterable[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  137. 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
  138. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  139. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toBuffer[B >: This.NodeT]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toCollection(repr: Iterable[This.NodeT]): Iterable[This.NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  142. final def toEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.EdgeT) ⇒ GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT
    Definition Classes
    InnerEdgeParam
  143. def toIndexedSeq: IndexedSeq[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toIterable: Iterable[This.NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  145. def toIterator: Iterator[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  146. def toList: List[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. 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
  149. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to CollectionsHaveToParArray[This.EdgeImpl, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.EdgeImpl) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  150. def toSeq: Seq[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def toSet[B >: This.NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toStream: Stream[This.NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  153. def toString(): String
    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any
  154. def toTraversable: Traversable[This.NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  155. def toVector: Vector[This.NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  157. def unzip[A1, A2](implicit asPair: (This.NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  158. def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  159. val value: This.EdgeImpl
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[This.EdgeImpl] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  160. def view(from: Int, until: Int): IterableView[This.NodeT, Iterable[This.NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  161. def view: IterableView[This.NodeT, Iterable[This.NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  162. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  163. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  164. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  165. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Iterable[This.NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  166. def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  167. def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  168. def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  169. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to EdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  170. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to EdgeAssoc[This.EdgeImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  171. final def ~~: Set[This.EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdge
    Annotations
    @inline()
  172. def →[B](y: B): (This.EdgeImpl, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to ArrowAssoc[This.EdgeImpl] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  3. def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike
  4. def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike
  5. def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike
  6. def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike
  7. def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  8. def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  10. def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  11. def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  14. def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  17. 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 to E[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
    TraversableOnce → GenTraversableOnce
  18. 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 to E[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
    TraversableOnce → GenTraversableOnce
  19. 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 to E[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
  20. 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 to E[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
  21. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).canEqual(that)
    Definition Classes
    EdgeLike → IterableLike → Equals
  22. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).canEqual(that)
    Definition Classes
    EdgeLike → IterableLike → Equals
  23. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  25. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  26. def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  27. def companion: GenericCompanion[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  28. def companion: GenericCompanion[Iterable]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  29. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: This.NodeT](xs: Array[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: This.NodeT](xs: Array[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  34. def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  35. def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  36. def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  37. def count(p: (This.NodeT) ⇒ Boolean): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  38. def count(p: (This.NodeT) ⇒ Boolean): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  39. 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 to E[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
  40. 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 to E[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
  41. def drop(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  42. def drop(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  43. def dropRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  44. def dropRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  45. def dropWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  46. def dropWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  47. def edge: EdgeLike[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  48. def edge: EdgeLike[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  49. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → Equals → AnyRef → Any
  50. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → Equals → AnyRef → Any
  51. def exists(p: (This.NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def exists(p: (This.NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def filter(p: (This.NodeT) ⇒ Boolean): TraversableOnce[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: MonadOps[This.NodeT]).filter(p)
    Definition Classes
    MonadOps
  54. def filter(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def filter(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def filterNot(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def filterNot(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  60. def flatMap[B](f: (This.NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: MonadOps[This.NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  61. def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  62. def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  63. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  64. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(asTraversable)
    Definition Classes
    GenericTraversableTemplate
  65. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(asTraversable)
    Definition Classes
    GenericTraversableTemplate
  66. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  67. def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  68. def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  69. def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  70. def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  71. def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  72. def forall(p: (This.NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. def forall(p: (This.NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  74. def foreach[U](f: (This.NodeT) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  75. def foreach[U](f: (This.NodeT) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  76. def genericBuilder[B]: Builder[B, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).genericBuilder
    Definition Classes
    GenericTraversableTemplate
  77. def genericBuilder[B]: Builder[B, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).genericBuilder
    Definition Classes
    GenericTraversableTemplate
  78. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  79. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  80. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  81. def grouped(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  82. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → TraversableOnce → GenTraversableOnce
  83. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → TraversableOnce → GenTraversableOnce
  84. 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 to E[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
  85. 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 to E[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
  86. 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 to E[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
  87. 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 to E[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
  88. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  89. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  90. def head: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  91. def head: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  92. def headOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  93. def headOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  94. def init: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  95. def init: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  96. def inits: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike
  97. def inits: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike
  98. 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 to E[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
  99. 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 to E[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
  100. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
  101. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  102. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  103. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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()
  104. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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()
  105. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
    NodeParam
  106. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    EdgeParam
  107. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    EdgeParam
  108. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  109. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  110. 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 to E[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
  111. 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 to E[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
  112. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
    InParam → Param
  113. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    InParam → Param
  114. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    InParam → Param
  115. 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 to E[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
  116. 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 to E[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
  117. 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 to E[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
  118. 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 to E[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
  119. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
  120. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  121. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  122. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
    InParam → Param
  123. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    InParam → Param
  124. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    InParam → Param
  125. final def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike → GenTraversableOnce
  126. final def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike → GenTraversableOnce
  127. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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()
  128. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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()
  129. 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 to E[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 → IterableLike → GenIterableLike
  130. 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 to E[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 → IterableLike → GenIterableLike
  131. 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 to E[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.

  132. 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 to E[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.

  133. def last: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  134. def last: This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  135. def lastOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  136. def lastOption: Option[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  137. def map[B](f: (This.NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: MonadOps[This.NodeT]).map(f)
    Definition Classes
    MonadOps
  138. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  139. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  140. 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 to E[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
  141. 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 to E[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
  142. def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. 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 to E[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
    TraversableOnce → GenTraversableOnce
  145. 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 to E[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
    TraversableOnce → GenTraversableOnce
  146. def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. 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 to E[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
    TraversableOnce → GenTraversableOnce
  149. 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 to E[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
    TraversableOnce → GenTraversableOnce
  150. def mkString: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  151. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  152. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  153. def mkString: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  154. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  155. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  156. 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 to E[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
  157. 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 to E[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
  158. 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 to E[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
  159. 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 to E[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
  160. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  161. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  162. 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 to E[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()
  163. 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 to E[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()
  164. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  165. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  166. def par: ParIterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).par
    Definition Classes
    Parallelizable
  167. def par: ParIterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).par
    Definition Classes
    Parallelizable
  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 to E[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
    TraversableLike → GenTraversableLike
  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 to E[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
    TraversableLike → GenTraversableLike
  170. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  171. def product[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  172. def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  173. def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  174. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  175. def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce
  176. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  177. def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  178. def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  179. def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  180. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  181. def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  182. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  183. def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  184. def repr: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  185. def repr: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  186. def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).sameElements(that)
    Definition Classes
    IterableLike → GenIterableLike
  187. def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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]).sameElements(that)
    Definition Classes
    IterableLike → GenIterableLike
  188. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(cbf)
    Definition Classes
    TraversableLike → GenTraversableLike
  189. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(cbf)
    Definition Classes
    TraversableLike → GenTraversableLike
  190. def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  191. def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  192. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  193. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  194. def seq: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  195. def seq: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  196. def size: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  197. def size: Int
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  198. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  199. def slice(from: Int, until: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  200. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  201. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  202. def sliding(size: Int, step: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  203. def sliding(size: Int): Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  204. def sources: Traversable[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 to E[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
  205. def sources: Traversable[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 to E[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
  206. def span(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  207. def span(p: (This.NodeT) ⇒ Boolean): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  208. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  209. def splitAt(n: Int): (Iterable[This.NodeT], Iterable[This.NodeT])
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  210. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
  211. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → TraversableLike → GenTraversableLike
  212. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → TraversableLike → GenTraversableLike
  213. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  214. def sum[B >: This.NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  215. def tail: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  216. def tail: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → GenTraversableLike
  217. def tails: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike
  218. def tails: Iterator[Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike
  219. def take(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  220. def take(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  221. def takeRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  222. def takeRight(n: Int): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike
  223. def takeWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  224. def takeWhile(p: (This.NodeT) ⇒ Boolean): Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableLike
  225. def targets: Traversable[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 to E[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
  226. def targets: Traversable[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 to E[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
  227. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cbf)
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  228. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(cbf)
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  229. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  230. def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  231. def toBuffer[B >: This.NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  232. def toBuffer[B >: This.NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  233. def toIndexedSeq: IndexedSeq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  234. def toIndexedSeq: IndexedSeq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  235. def toIterable: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  236. def toIterable: Iterable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableOnce → GenTraversableOnce
  237. def toIterator: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  238. def toIterator: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  239. def toList: List[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  240. def toList: List[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  241. def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  242. def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  243. def toSeq: Seq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  244. def toSeq: Seq[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  245. def toSet[B >: This.NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  246. def toSet[B >: This.NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  247. def toStream: Stream[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableOnce
  248. def toStream: Stream[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike → GenTraversableOnce
  249. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to OuterNode[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
  250. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → TraversableLike → AnyRef → Any
  251. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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 → TraversableLike → AnyRef → Any
  252. def toTraversable: Traversable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  253. def toTraversable: Traversable[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  254. def toVector: Vector[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  255. def toVector: Vector[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableOnce → GenTraversableOnce
  256. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(asTraversable)
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  257. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(asTraversable)
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  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 to E[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 to E[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 to E[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
    GenericTraversableTemplate
  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 to E[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
    GenericTraversableTemplate
  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 to E[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
    GenericTraversableTemplate
  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 to E[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
    GenericTraversableTemplate
  264. def view(from: Int, until: Int): IterableView[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike
  265. def view: IterableView[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike
  266. def view(from: Int, until: Int): IterableView[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike
  267. def view: IterableView[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    IterableLike → TraversableLike
  268. 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.

    For weight types other than Long you may either convert then to Long prior to edge creation or define a custom edge class that includes the weight of the appropriate type and overrides def weight to provide the required conversion to Long.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  269. 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.

    For weight types other than Long you may either convert then to Long prior to edge creation or define a custom edge class that includes the weight of the appropriate type and overrides def weight to provide the required conversion to Long.

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  270. def withFilter(p: (This.NodeT) ⇒ Boolean): Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to MonadOps[This.NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (edgeImpl: MonadOps[This.NodeT]).withFilter(p)
    Definition Classes
    MonadOps
  271. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → FilterMonadic
  272. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Iterable[This.NodeT]]
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
    TraversableLike → FilterMonadic
  273. def withSources[U](f: (This.NodeT) ⇒ U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  274. def withSources[U](f: (This.NodeT) ⇒ U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  275. def withTargets[U](f: (This.NodeT) ⇒ U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  276. def withTargets[U](f: (This.NodeT) ⇒ U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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
  277. def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  278. def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  279. def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  280. def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  281. def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, Int), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(bf)
    Definition Classes
    IterableLike → GenIterableLike
  282. def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Iterable[This.NodeT], (A1, Int), That]): That
    Implicit
    This member is added by an implicit conversion from This.EdgeImpl to E[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(bf)
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

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

    (Since version 1.8.0) Use toOuter instead

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 Serializable

Inherited from Iterable[This.NodeT]

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

Inherited from Equals

Inherited from GenIterable[This.NodeT]

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

Inherited from Traversable[This.NodeT]

Inherited from GenTraversable[This.NodeT]

Inherited from GenericTraversableTemplate[This.NodeT, Iterable]

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

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

Inherited from Parallelizable[This.NodeT, ParIterable[This.NodeT]]

Inherited from TraversableOnce[This.NodeT]

Inherited from GenTraversableOnce[This.NodeT]

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

Inherited from HasNewBuilder[This.NodeT, Iterable[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 anyToNode from This.EdgeImpl to OuterNode[This.EdgeImpl]

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

Inherited by implicit conversion MonadOps from This.EdgeImpl to MonadOps[This.NodeT]

Inherited by implicit conversion flattenTraversableOnce from This.EdgeImpl to FlattenOps[N]

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

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

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

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

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

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

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

Inherited by implicit conversion alternateImplicit from This.EdgeImpl to ForceImplicitAmbiguity

Ungrouped