Packages

abstract class WkLDiEdge[+N] extends WkLUnDiEdge[N] with DiEdgeLike[N] with OuterEdge[N, WkLDiEdge] with EqDi

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WkLDiEdge
  2. DiEdgeLike
  3. EqDi
  4. DiHyperEdgeLike
  5. EqDiHyper
  6. WkLUnDiEdge
  7. WkEdge
  8. Keyed
  9. WLUnDiEdge
  10. WLEdge
  11. LEdge
  12. WUnDiEdge
  13. WEdge
  14. UnDiEdge
  15. EqUnDi
  16. HyperEdge
  17. EqHyper
  18. OuterEdge
  19. EdgeParam
  20. InParam
  21. Param
  22. EdgeCopy
  23. EdgeLike
  24. Serializable
  25. Serializable
  26. Eq
  27. Iterable
  28. IterableLike
  29. Equals
  30. GenIterable
  31. GenIterableLike
  32. Traversable
  33. GenTraversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. GenTraversableLike
  37. Parallelizable
  38. TraversableOnce
  39. GenTraversableOnce
  40. FilterMonadic
  41. HasNewBuilder
  42. AnyRef
  43. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by HyperEdgeAssoc
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WkLDiEdge(nodes: Product, weight: Long)

Type Members

  1. class EdgeException extends Exception
    Attributes
    protected
    Definition Classes
    EdgeLike
  2. abstract type L1
    Definition Classes
    LEdge
  3. type Self = Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  4. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to any2stringadd[WkLDiEdge[N]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (WkLDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def _1: N

    The first node.

    The first node. Same as _n(0).

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  12. def _2: N

    The second node.

    The second node. Same as _n(1).

    Definition Classes
    EdgeLike
  13. def _n(n: Int): N

    The n'th node with 0 <= n < arity.

    The n'th node with 0 <= n < arity.

    Definition Classes
    EdgeLike
  14. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  17. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. final def arity: Int

    Number of nodes linked by this Edge.

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

    Definition Classes
    EdgeLike
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def attributesToString: String
    Attributes
    protected
    Definition Classes
    WLEdgeLEdgeWEdge
  21. final def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqDiEq
  22. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqDiEq
  23. def brackets: Brackets
    Attributes
    protected
    Definition Classes
    EdgeLike
  24. def canEqual(that: Any): Boolean
    Definition Classes
    EdgeLike → IterableLike → Equals
  25. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]
    Definition Classes
    TraversableOnce
  28. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  29. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  30. def copy[NN](newNodes: Product): WUnDiEdge[NN]

    It is a prerequisite for edge-classes to implement this method.

    It is a prerequisite for edge-classes to implement this method. Otherwise they cannot be passed to a Graph.

    Graph calls this method internally to obtain a new instance of the edge passed to Graph with nodes of the type of the inner class NodeT which itself contains the outer node.

    Attributes
    protected[scalax.collection]
    Definition Classes
    WUnDiEdgeUnDiEdgeHyperEdgeEdgeCopy
  31. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. final def diBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqDi
    Annotations
    @inline()
  37. final def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Definition Classes
    DiHyperEdgeLikeEdgeLike
    Annotations
    @inline()
  38. def drop(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  40. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. val e: EdgeLikeIn[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  42. def edge: WkLDiEdge[N]
    Definition Classes
    OuterEdge
  43. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  44. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  45. def ensuring(cond: (WkLDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Ensuring[WkLDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: (WkLDiEdge[N]) ⇒ Boolean): WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Ensuring[WkLDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: Boolean, msg: ⇒ Any): WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Ensuring[WkLDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: Boolean): WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Ensuring[WkLDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    WkEdge
  51. def equals(other: Any): Boolean
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  52. def exists(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def filter(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def filterNot(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  56. def find(p: (N) ⇒ Boolean): Option[N]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  58. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  59. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldRight[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  62. def forall(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  63. def foreach[U](f: (N) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  64. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to StringFormat[WkLDiEdge[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  65. final def from: N

    Synonym for source.

    Synonym for source.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  66. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  67. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  68. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def grouped(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  70. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  71. final def hasSource(pred: (N) ⇒ Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  72. final def hasSource[M >: N](node: M): Boolean

    true if node is a source of this edge.

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  73. final def hasTarget(pred: (N) ⇒ Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  74. final def hasTarget[M >: N](node: M): Boolean

    true if node is a target of this edge.

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  75. def hashCode(): Int
    Definition Classes
    WkEdge → AnyRef → Any
  76. def head: N
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  77. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def init: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def inits: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  80. def isAt(pred: (N) ⇒ Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike
  81. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike
  82. def isDefined: Boolean
    Definition Classes
    Param
  83. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  84. def isEdge: Boolean
    Definition Classes
    EdgeParam
  85. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  86. final def isHyperEdge: Boolean

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

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

    Definition Classes
    UnDiEdgeEdgeLike
    Annotations
    @inline()
  87. def isIn: Boolean
    Definition Classes
    InParamParam
  88. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  89. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  90. def isLooping: Boolean

    true if this edge produces a self-loop.

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

    Definition Classes
    EdgeLike
  91. def isNode: Boolean
    Definition Classes
    EdgeParam
  92. def isOut: Boolean
    Definition Classes
    InParamParam
  93. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  94. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  95. final def isValidArity(size: Int): Boolean

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid.

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike
    Annotations
    @inline()
  96. def isValidCustom: Boolean

    This method may be overridden to enforce additional validation at edge creation time.

    This method may be overridden to enforce additional validation at edge creation time. Be careful to call super.isValidCustom when overriding. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    EdgeLike
  97. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  98. def iterator: Iterator[N]

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

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

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike → IterableLike → GenIterableLike
  99. def label: L1
    Definition Classes
    LEdge
  100. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  103. def matches(p1: (N) ⇒ Boolean, p2: (N) ⇒ Boolean): Boolean

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

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  104. def matches[M >: N](n1: M, n2: M): Boolean

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

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  105. final def matches(fList: List[(N) ⇒ Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    HyperEdge
  106. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. val n1: WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  114. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  115. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  116. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  117. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  118. val nodes: Product
    Definition Classes
    HyperEdgeEdgeLike
  119. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  120. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    DiHyperEdgeLikeEdgeLike
  121. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  122. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  124. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  125. final def notify(): Unit
    Definition Classes
    AnyRef
  126. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  127. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  128. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  129. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  130. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  131. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  134. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  137. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  140. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  141. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def scanRight[B, That](z: B)(op: (N, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  144. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  145. final def size: Int
    Definition Classes
    UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  146. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  147. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  148. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  149. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  150. final def source: N

    The single source node of this directed edge.

    The single source node of this directed edge.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  151. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    EdgeLike
  152. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  155. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  157. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  158. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  159. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  160. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  161. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  162. final def target: N

    The target node for a directed edge; one of the target nodes for a directed hyperedge.

    The target node for a directed edge; one of the target nodes for a directed hyperedge.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  163. def targets: Traversable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  164. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  165. final def thisSimpleClassName: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  166. final def to: N

    Synonym for target.

    Synonym for target.

    Definition Classes
    DiEdgeLikeDiHyperEdgeLike
    Annotations
    @inline()
  167. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  168. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  171. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  172. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  174. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  175. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  178. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  179. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to CollectionsHaveToParArray[WkLDiEdge[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (WkLDiEdge[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  180. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  183. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  184. def toStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  185. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  186. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def transpose[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  188. final def unDiBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  189. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  190. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  191. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  192. final def validate: Unit

    Performs basic, inevitable edge validation.

    Performs basic, inevitable edge validation. Among others, ensures that nodes ne null and no edge end eq null.

    This validation method must be called in the constructor of any edge class that directly extends or mixes in EdgeLike. To perform additional custom validation isValidCustom is to be overridden.

    Attributes
    protected
    Definition Classes
    EdgeLike
    Exceptions thrown

    EdgeException if any of the basic validations or of eventually supplied additional validations fails.

  193. val value: WkLDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  194. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  195. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  196. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  197. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  198. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  199. val weight: Long
    Definition Classes
    WUnDiEdgeEdgeLike
  200. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  201. final def withSources[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  202. final def withTargets[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    DiEdgeLikeDiHyperEdgeLikeEdgeLike
  203. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  204. def zipAll[B, A1 >: N, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  205. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  206. def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  207. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  208. def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  209. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  210. def [B](y: B): (WkLDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to MonadOps[N] 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:
    (wkLDiEdge: MonadOps[N]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to MonadOps[N] 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:
    (wkLDiEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).isDefined
    Definition Classes
    Param
  4. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).isEdge
    Definition Classes
    NodeParam
  5. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).isIn
    Definition Classes
    InParamParam
  6. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).isOut
    Definition Classes
    InParamParam
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to MonadOps[N] 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:
    (wkLDiEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] 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:
    (wkLDiEdge: OuterNode[WkLDiEdge[N]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def withFilter(p: (N) ⇒ Boolean): Iterator[N]
    Implicit
    This member is added by an implicit conversion from WkLDiEdge[N] to MonadOps[N] 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:
    (wkLDiEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from DiEdgeLike[N]

Inherited from EqDi

Inherited from DiHyperEdgeLike[N]

Inherited from EqDiHyper

Inherited from WkLUnDiEdge[N]

Inherited from WkEdge[N]

Inherited from Keyed

Inherited from WLUnDiEdge[N]

Inherited from WLEdge[N]

Inherited from LEdge[N]

Inherited from WUnDiEdge[N]

Inherited from WEdge[N]

Inherited from UnDiEdge[N]

Inherited from EqUnDi

Inherited from HyperEdge[N]

Inherited from EqHyper

Inherited from OuterEdge[N, WkLDiEdge]

Inherited from EdgeParam

Inherited from InParam[N, WkLDiEdge]

Inherited from Param[N, WkLDiEdge]

Inherited from EdgeCopy[WUnDiEdge]

Inherited from EdgeLike[N]

Inherited from Serializable

Inherited from Serializable

Inherited from Eq

Inherited from Iterable[N]

Inherited from IterableLike[N, Iterable[N]]

Inherited from Equals

Inherited from GenIterable[N]

Inherited from GenIterableLike[N, Iterable[N]]

Inherited from Traversable[N]

Inherited from GenTraversable[N]

Inherited from TraversableLike[N, Iterable[N]]

Inherited from GenTraversableLike[N, Iterable[N]]

Inherited from Parallelizable[N, ParIterable[N]]

Inherited from TraversableOnce[N]

Inherited from GenTraversableOnce[N]

Inherited from FilterMonadic[N, Iterable[N]]

Inherited from HasNewBuilder[N, Iterable[N]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]]

Inherited by implicit conversion CollectionsHaveToParArray from WkLDiEdge[N] to CollectionsHaveToParArray[WkLDiEdge[N], T]

Inherited by implicit conversion MonadOps from WkLDiEdge[N] to MonadOps[N]

Inherited by implicit conversion HyperEdgeAssoc from WkLDiEdge[N] to HyperEdgeAssoc[N]

Inherited by implicit conversion EdgeAssoc from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]]

Inherited by implicit conversion graphParamsToPartition from WkLDiEdge[N] to Partitions[N, E]

Inherited by implicit conversion any2stringadd from WkLDiEdge[N] to any2stringadd[WkLDiEdge[N]]

Inherited by implicit conversion StringFormat from WkLDiEdge[N] to StringFormat[WkLDiEdge[N]]

Inherited by implicit conversion Ensuring from WkLDiEdge[N] to Ensuring[WkLDiEdge[N]]

Inherited by implicit conversion ArrowAssoc from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]]

Inherited by implicit conversion alternateImplicit from WkLDiEdge[N] to ForceImplicitAmbiguity

Ungrouped