scalax.collection.mutable.AdjacencyListGraph

EdgeImpl

class EdgeImpl extends This.EdgeBase

Annotations
@SerialVersionUID( 7972L )
Linear Supertypes
This.EdgeBase, 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
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeImpl
  2. EdgeBase
  3. InnerEdge
  4. InnerElem
  5. Edge
  6. Serializable
  7. Serializable
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. GenTraversableLike
  18. Parallelizable
  19. TraversableOnce
  20. GenTraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. InnerEdgeParam
  24. EdgeParam
  25. OutParam
  26. Param
  27. AnyRef
  28. Any
Implicitly
  1. by anyToNode
  2. by traversable2ops
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by toEdge
  8. by innerEdgeToEdgeCont
  9. by any2stringadd
  10. by any2stringfmt
  11. by any2ArrowAssoc
  12. by any2Ensuring
  13. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. type Self = Iterable[This.NodeT]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

  8. def ->[B](y: B): (This.EdgeImpl, B)

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to ArrowAssoc[This.EdgeImpl] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  13. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

  16. 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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  18. 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

  19. final def asEdgeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.EdgeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam

  20. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  21. def asParIterable: ParIterable[This.NodeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  22. def asParSeq: ParSeq[This.NodeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  23. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdge → IterableLike → Equals

  24. def clone(): AnyRef

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  27. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  28. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit information
    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()

  29. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit information
    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()

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

  34. def count(p: (This.NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  38. 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

  39. def edgeParams: Iterable[EdgeParam]

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

  40. val elems: Iterable[Param[N, E]]

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

  41. def ensuring(cond: (This.EdgeImpl) ⇒ Boolean, msg: ⇒ Any): This.EdgeImpl

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

  42. def ensuring(cond: (This.EdgeImpl) ⇒ Boolean): This.EdgeImpl

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

  43. def ensuring(cond: Boolean, msg: ⇒ Any): This.EdgeImpl

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

  44. def ensuring(cond: Boolean): This.EdgeImpl

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

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

    Definition Classes
    AnyRef

  46. def equals(other: Any): Boolean

    Definition Classes
    InnerEdge → Equals → AnyRef → Any

  47. def exists(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  50. def finalize(): Unit

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  55. 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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  58. def forall(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  60. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  65. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  66. 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 information
    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

  67. 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 information
    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

  68. 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 information
    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

  69. 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 information
    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

  70. def hashCode(): Int

    Definition Classes
    InnerEdge → AnyRef → Any

  71. def head: This.NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  72. def headOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  73. def ifParSeq[R](isbody: (ParSeq[This.NodeT]) ⇒ R): (TraversableOps[This.NodeT])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  74. def init: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  75. def inits: Iterator[Iterable[This.NodeT]]

    Definition Classes
    TraversableLike

  76. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit information
    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

  77. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit information
    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

  78. final def isContaining[N <: N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

    Definition Classes
    InnerEdgeParam

  79. def isDefined: Boolean

    Definition Classes
    Param

  80. def isEdge: Boolean

    Definition Classes
    EdgeParam

  81. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  82. def isIn: Boolean

    Definition Classes
    OutParam → Param

  83. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  84. def isNode: Boolean

    Definition Classes
    EdgeParam

  85. def isOut: Boolean

    Definition Classes
    OutParam → Param

  86. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  87. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  88. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  89. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  90. def iterator: Iterator[This.NodeT]

    Definition Classes
    EdgeBase → IterableLike → GenIterableLike

  91. def last: This.NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  92. def lastOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  94. 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 information
    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

  95. 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 information
    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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  101. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  103. val n1: This.EdgeImpl

    Implicit information
    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

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

    Definition Classes
    AnyRef

  105. def newBuilder: Builder[This.NodeT, Iterable[This.NodeT]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  106. def nodeParams: Iterable[NodeParam[N]]

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

  107. 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()

  108. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  109. final def notify(): Unit

    Definition Classes
    AnyRef

  110. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  111. def par: ParIterable[This.NodeT]

    Definition Classes
    Parallelizable

  112. def parCombiner: Combiner[This.NodeT, ParIterable[This.NodeT]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

  114. lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

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

  115. 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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def remove: Boolean

  124. def removeWithNodes(edge: E[N]): Boolean

  125. def repr: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  126. def reversed: List[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    IterableLike → GenIterableLike

  128. 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

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

    Definition Classes
    TraversableLike → GenTraversableLike

  130. 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.

  131. def seq: Iterable[This.NodeT]

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

  132. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  138. def stringPrefix: String

    Definition Classes
    EdgeBase → InnerEdge → TraversableLike → GenTraversableLike → InnerEdgeParam

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  141. def tail: Iterable[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  142. def tails: Iterator[Iterable[This.NodeT]]

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  146. def thisCollection: Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  147. def to: This.NodeT

    Definition Classes
    InnerEdge

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  150. def toBuffer[B >: This.NodeT]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  151. def toCollection(repr: Iterable[This.NodeT]): Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  152. 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

  153. def toInParams: Iterable[InParam[N, E]]

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

  154. def toIndexedSeq: IndexedSeq[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  155. def toIterable: Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  156. def toIterator: Iterator[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  157. def toList: List[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  159. 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

  160. def toOuterEdges: Iterable[E[N]]

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

  161. def toOuterNodes: Iterable[N]

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

  162. def toParArray: ParArray[This.NodeT]

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to TraversableOps[This.NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  163. def toSeq: Seq[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  164. def toSet[B >: This.NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  165. def toStream: Stream[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  166. def toString(): String

    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any

  167. def toTraversable: Traversable[This.NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  168. def toVector: Vector[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  169. 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.

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

  172. val value: This.EdgeImpl

    Implicit information
    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

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

    Definition Classes
    IterableLike → TraversableLike

  174. def view: IterableView[This.NodeT, Iterable[This.NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  175. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    TraversableLike → FilterMonadic

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

    Definition Classes
    IterableLike → GenIterableLike

  180. 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

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

    Definition Classes
    IterableLike → GenIterableLike

  182. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    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()

  183. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    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()

  184. final def ~~: Set[This.EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdge
    Annotations
    @inline()

  185. def →[B](y: B): (This.EdgeImpl, B)

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to ArrowAssoc[This.EdgeImpl] performed by method any2ArrowAssoc 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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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. Hyper-edges may link more than two nodes.

    Implicit information
    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. Hyper-edges may link more than two nodes.

    Implicit information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 it this edge is directed.

    true it this edge is directed.

    Implicit information
    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 it this edge is directed.

    true it this edge is directed.

    Implicit information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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) meaning that edges of different labels connecting the same nodes will be treated as equal and not added more than once. If 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 information
    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) meaning that edges of different labels connecting the same nodes will be treated as equal and not added more than once. If 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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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. val self: Any

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to StringAdd performed by method any2stringadd in scala.Predef.
    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: StringAdd).self
    Definition Classes
    StringAdd

  195. val self: Any

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to StringFormat performed by method any2stringfmt in scala.Predef.
    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: StringFormat).self
    Definition Classes
    StringFormat

  196. def seq: Iterable[This.NodeT]

    Implicit information
    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

  197. def seq: Iterable[This.NodeT]

    Implicit information
    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

  198. def size: Int

    Implicit information
    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

  199. def size: Int

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 information
    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 to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  229. def toBuffer[B >: This.NodeT]: Buffer[B]

    Implicit information
    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

  230. def toBuffer[B >: This.NodeT]: Buffer[B]

    Implicit information
    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

  231. def toIndexedSeq: IndexedSeq[This.NodeT]

    Implicit information
    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

  232. def toIndexedSeq: IndexedSeq[This.NodeT]

    Implicit information
    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

  233. def toIterable: Iterable[This.NodeT]

    Implicit information
    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

  234. def toIterable: Iterable[This.NodeT]

    Implicit information
    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

  235. def toIterator: Iterator[This.NodeT]

    Implicit information
    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

  236. def toIterator: Iterator[This.NodeT]

    Implicit information
    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

  237. def toList: List[This.NodeT]

    Implicit information
    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

  238. def toList: List[This.NodeT]

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  241. def toSeq: Seq[This.NodeT]

    Implicit information
    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

  242. def toSeq: Seq[This.NodeT]

    Implicit information
    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

  243. def toSet[B >: This.NodeT]: Set[B]

    Implicit information
    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

  244. def toSet[B >: This.NodeT]: Set[B]

    Implicit information
    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

  245. def toStream: Stream[This.NodeT]

    Implicit information
    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

  246. def toStream: Stream[This.NodeT]

    Implicit information
    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

  247. def toString(): String

    Implicit information
    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

  248. def toString(): String

    Implicit information
    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

  249. def toString(): String

    Implicit information
    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

  250. def toTraversable: Traversable[This.NodeT]

    Implicit information
    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

  251. def toTraversable: Traversable[This.NodeT]

    Implicit information
    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

  252. def toVector: Vector[This.NodeT]

    Implicit information
    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

  253. def toVector: Vector[This.NodeT]

    Implicit information
    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

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

    Implicit information
    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.

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

    Implicit information
    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.

  256. final def undirected: Boolean

    true it this edge is undirected.

    true it this edge is undirected.

    Implicit information
    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()

  257. final def undirected: Boolean

    true it this edge is undirected.

    true it this edge is undirected.

    Implicit information
    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()

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  263. def view: IterableView[This.NodeT, Iterable[This.NodeT]]

    Implicit information
    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

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

    Implicit information
    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

  265. def view: IterableView[This.NodeT, Iterable[This.NodeT]]

    Implicit information
    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

  266. def weight: Long

    The weight of this edge defaulting to 1L.

    The weight of this edge defaulting to 1L.

    Note that weight is normally not part of the edge key (hashCode) meaning that edges of different weights connecting the same nodes will be treated as equal and not added more than once. If 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.

    In case of weights of a type other than Long you either convert values of that type to Long prior to edge creation or define a custom edge class to include your own val of that type and override def weight to provide a conversion.

    Implicit information
    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

  267. def weight: Long

    The weight of this edge defaulting to 1L.

    The weight of this edge defaulting to 1L.

    Note that weight is normally not part of the edge key (hashCode) meaning that edges of different weights connecting the same nodes will be treated as equal and not added more than once. If 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.

    In case of weights of a type other than Long you either convert values of that type to Long prior to edge creation or define a custom edge class to include your own val of that type and override def weight to provide a conversion.

    Implicit information
    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

  268. def withFilter(p: (This.NodeT) ⇒ Boolean): Iterator[This.NodeT]

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  271. def withSources(f: (This.NodeT) ⇒ Unit): Unit

    Applies f to the source end resp.

    Applies f to the source end resp. to all source ends of this edge.

    Implicit information
    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

  272. def withSources(f: (This.NodeT) ⇒ Unit): Unit

    Applies f to the source end resp.

    Applies f to the source end resp. to all source ends of this edge.

    Implicit information
    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

  273. def withTargets(f: (This.NodeT) ⇒ Unit): Unit

    Applies f to the target end resp.

    Applies f to the target end resp. to all target ends of this edge.

    Implicit information
    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

  274. def withTargets(f: (This.NodeT) ⇒ Unit): Unit

    Applies f to the target end resp.

    Applies f to the target end resp. to all target ends of this edge.

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  277. 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 information
    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

  278. 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 information
    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

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

    Implicit information
    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

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

    Implicit information
    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 /:\[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Implicit information
    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
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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

    Implicit information
    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
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  4. def toEdgeIn: E[N]

    Definition Classes
    InnerEdge
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

  5. def x: This.EdgeImpl

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to ArrowAssoc[This.EdgeImpl] performed by method any2ArrowAssoc in scala.Predef.
    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: ArrowAssoc[This.EdgeImpl]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  6. def x: This.EdgeImpl

    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to Ensuring[This.EdgeImpl] performed by method any2Ensuring in scala.Predef.
    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: Ensuring[This.EdgeImpl]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from This.EdgeBase

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 traversable2ops from This.EdgeImpl to TraversableOps[This.NodeT]

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 graphParamsToPartition from This.EdgeImpl to Partitions[N, E]

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 StringAdd

Inherited by implicit conversion any2stringfmt from This.EdgeImpl to StringFormat

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

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

Inherited by implicit conversion alternateImplicit from This.EdgeImpl to ForceImplicitAmbiguity

Ungrouped