Class

scalax.collection.mutable.AdjacencyListGraph

EdgeImpl

Related Doc: package AdjacencyListGraph

Permalink

class EdgeImpl extends This.EdgeBase

Annotations
@SerialVersionUID()
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
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 CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by toEdge
  8. by innerEdgeToEdgeCont
  9. by any2stringadd
  10. by StringFormat
  11. by Ensuring
  12. by ArrowAssoc
  13. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

    Permalink

Type Members

  1. type Self = Iterable[This.NodeT]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

  14. def adjacents: Set[This.EdgeT]

    Permalink

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

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

    returns

    set of connecting edges including hooks.

    Definition Classes
    InnerEdge

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  16. final def asEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam

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

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam

  18. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  19. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    InnerEdge → IterableLike → Equals

  20. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableOnce

  23. def companion: GenericCompanion[Iterable]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

    Permalink

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

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

    Permalink

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  34. val edge: E[This.NodeT]

    Permalink

    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

  35. def edgeParams: Traversable[EdgeParam]

    Permalink
    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

  36. val elems: Traversable[Param[N, E]]

    Permalink
    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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef

  42. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    InnerEdge → Equals → AnyRef → Any

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  46. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    InnerEdgeParam

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  56. def formatted(fmtstr: String): String

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

  61. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  62. def hasSource[M >: N](node: M): Boolean

    Permalink

    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

  63. def hasSource[M >: N](node: M): Boolean

    Permalink

    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

  64. def hasTarget[M >: N](node: M): Boolean

    Permalink

    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

  65. def hasTarget[M >: N](node: M): Boolean

    Permalink

    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

  66. def hashCode(): Int

    Permalink
    Definition Classes
    InnerEdge → AnyRef → Any

  67. def head: This.NodeT

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  68. def headOption: Option[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  69. def init: Iterable[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink

    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

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

    Permalink

    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

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

    Permalink
    Definition Classes
    InnerEdgeParam

  74. def isDefined: Boolean

    Permalink
    Definition Classes
    Param

  75. def isEdge: Boolean

    Permalink
    Definition Classes
    EdgeParam

  76. def isEmpty: Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  77. def isIn: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  78. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  79. def isNode: Boolean

    Permalink
    Definition Classes
    EdgeParam

  80. def isOut: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  81. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  82. def iterator: Iterator[This.NodeT]

    Permalink
    Definition Classes
    EdgeBase → IterableLike → GenIterableLike

  83. def last: This.NodeT

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  84. def lastOption: Option[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  86. def matches[M >: N](n1: M, n2: M): Boolean

    Permalink

    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

  87. def matches[M >: N](n1: M, n2: M): Boolean

    Permalink

    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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. val n1: This.EdgeImpl

    Permalink
    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

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  98. def nodeParams: Traversable[NodeParam[N]]

    Permalink
    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

  99. final def nodes: Iterable[This.NodeT]

    Permalink

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

  100. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  101. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  102. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  103. def par: ParIterable[This.NodeT]

    Permalink
    Definition Classes
    Parallelizable

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  106. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])

    Permalink
    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. def privateNodes: Set[This.NodeT]

    Permalink

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

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

    returns

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

    Definition Classes
    InnerEdge

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def remove: Boolean

    Permalink

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

    Permalink

  117. def repr: Iterable[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  118. def reversed: List[This.NodeT]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

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

  123. def seq: Iterable[This.NodeT]

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

  124. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  130. def stringPrefix: String

    Permalink
    Definition Classes
    EdgeBase → InnerEdge → TraversableLike → GenTraversableLike → InnerEdgeParam

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  133. def tail: Iterable[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    IterableLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  138. def thisCollection: Iterable[This.NodeT]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  139. def to: This.NodeT

    Permalink

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

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

    Definition Classes
    InnerEdge

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Permalink
    Definition Classes
    InnerEdgeParam

  145. def toInParams: Traversable[InParam[N, E]]

    Permalink
    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

  146. def toIndexedSeq: IndexedSeq[This.NodeT]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  147. def toIterable: Iterable[This.NodeT]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  148. def toIterator: Iterator[This.NodeT]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  149. def toList: List[This.NodeT]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  151. def toOuter: E[N]

    Permalink

    Reconstructs the outer edge by means of the copy method.

    Reconstructs the outer edge by means of the copy method.

    Definition Classes
    InnerEdge

  152. def toOuterEdges: Traversable[E[N]]

    Permalink
    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

  153. def toOuterNodes: Traversable[N]

    Permalink
    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 toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.EdgeImpl to CollectionsHaveToParArray[This.EdgeImpl, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.EdgeImpl) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray

  155. def toSeq: Seq[This.NodeT]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  157. def toStream: Stream[This.NodeT]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  158. def toString(): String

    Permalink
    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any

  159. def toTraversable: Traversable[This.NodeT]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  160. def toVector: Vector[This.NodeT]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

  164. val value: This.EdgeImpl

    Permalink
    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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike

  167. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  174. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    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()

  175. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    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()

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

    Permalink

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdge
    Annotations
    @inline()

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

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

Shadowed Implicit Value Members

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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    Number of nodes linked by this Edge.

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

    Implicit 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

    Permalink

    Number of nodes linked by this Edge.

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

    Implicit 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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    true if this edge is directed.

    true if 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

    Permalink

    true if this edge is directed.

    true if 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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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]

    Permalink

    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]

    Permalink

    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

    Permalink

    The label of this edge.

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

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

    Implicit 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

    Permalink

    The label of this edge.

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

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

    Implicit 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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink

    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]

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink
    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

    Permalink
    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

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink

    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]

    Permalink
    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]

    Permalink
    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])

    Permalink
    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])

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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. def seq: Iterable[This.NodeT]

    Permalink
    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

  195. def seq: Iterable[This.NodeT]

    Permalink
    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

  196. def size: Int

    Permalink
    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

  197. def size: Int

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  204. def sources: Traversable[This.NodeT]

    Permalink

    All source ends of this edge.

    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]).sources
    Definition Classes
    EdgeLike

  205. def sources: Traversable[This.NodeT]

    Permalink

    All source ends of this edge.

    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]).sources
    Definition Classes
    EdgeLike

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

    Permalink
    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])

    Permalink
    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])

    Permalink
    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])

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]]

    Permalink
    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]]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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 targets: Traversable[This.NodeT]

    Permalink

    All target ends of this edge.

    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]).targets
    Definition Classes
    EdgeLike

  226. def targets: Traversable[This.NodeT]

    Permalink

    All target ends of this edge.

    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]).targets
    Definition Classes
    EdgeLike

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  233. def toIndexedSeq: IndexedSeq[This.NodeT]

    Permalink
    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

  234. def toIndexedSeq: IndexedSeq[This.NodeT]

    Permalink
    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

  235. def toIterable: Iterable[This.NodeT]

    Permalink
    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

  236. def toIterable: Iterable[This.NodeT]

    Permalink
    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

  237. def toIterator: Iterator[This.NodeT]

    Permalink
    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
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  238. def toIterator: Iterator[This.NodeT]

    Permalink
    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
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  239. def toList: List[This.NodeT]

    Permalink
    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

  240. def toList: List[This.NodeT]

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  243. def toSeq: Seq[This.NodeT]

    Permalink
    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

  244. def toSeq: Seq[This.NodeT]

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  247. def toStream: Stream[This.NodeT]

    Permalink
    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

  248. def toStream: Stream[This.NodeT]

    Permalink
    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

  249. def toString(): String

    Permalink
    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

  250. def toString(): String

    Permalink
    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

  251. def toString(): String

    Permalink
    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

  252. def toTraversable: Traversable[This.NodeT]

    Permalink
    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
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  253. def toTraversable: Traversable[This.NodeT]

    Permalink
    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
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  254. def toVector: Vector[This.NodeT]

    Permalink
    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

  255. def toVector: Vector[This.NodeT]

    Permalink
    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

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

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

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

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

  258. final def undirected: Boolean

    Permalink

    true if this edge is undirected.

    true if 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()

  259. final def undirected: Boolean

    Permalink

    true if this edge is undirected.

    true if 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()

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  268. def weight: Double

    Permalink

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

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

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

    Implicit 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

  269. def weight: Double

    Permalink

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

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

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

    Implicit 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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

  273. def withSources[U](f: (This.NodeT) ⇒ U): Unit

    Permalink

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

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

    Implicit 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

  274. def withSources[U](f: (This.NodeT) ⇒ U): Unit

    Permalink

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

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

    Implicit 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

  275. def withTargets[U](f: (This.NodeT) ⇒ U): Unit

    Permalink

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

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

    Implicit 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

  276. def withTargets[U](f: (This.NodeT) ⇒ U): Unit

    Permalink

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

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

    Implicit 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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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

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

    Permalink
    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 toEdgeIn: E[N]

    Permalink
    Definition Classes
    InnerEdge
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from This.EdgeBase

Inherited from This.InnerEdge

Inherited from This.InnerElem

Inherited from This.Edge

Inherited from Serializable

Inherited from Serializable

Inherited from Iterable[This.NodeT]

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

Inherited from Equals

Inherited from GenIterable[This.NodeT]

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

Inherited from Traversable[This.NodeT]

Inherited from GenTraversable[This.NodeT]

Inherited from GenericTraversableTemplate[This.NodeT, Iterable]

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

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

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

Inherited from TraversableOnce[This.NodeT]

Inherited from GenTraversableOnce[This.NodeT]

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

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

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

Inherited from EdgeParam

Inherited from OutParam[N, E]

Inherited from Param[N, E]

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

Inherited by implicit conversion 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 any2stringadd[This.EdgeImpl]

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

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

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

Inherited by implicit conversion alternateImplicit from This.EdgeImpl to ForceImplicitAmbiguity

Ungrouped