Packages

abstract class LkDiHyperEdge[+N] extends LDiHyperEdge[N] with OuterEdge[N, LkDiHyperEdge] with LkEdge[N]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LkDiHyperEdge
  2. LkEdge
  3. Keyed
  4. LDiHyperEdge
  5. DiHyperEdgeLike
  6. EqDiHyper
  7. LHyperEdge
  8. LEdge
  9. HyperEdge
  10. EqHyper
  11. OuterEdge
  12. EdgeParam
  13. InParam
  14. Param
  15. EdgeCopy
  16. EdgeLike
  17. Serializable
  18. Serializable
  19. Eq
  20. Iterable
  21. IterableLike
  22. Equals
  23. GenIterable
  24. GenIterableLike
  25. Traversable
  26. GenTraversable
  27. GenericTraversableTemplate
  28. TraversableLike
  29. GenTraversableLike
  30. Parallelizable
  31. TraversableOnce
  32. GenTraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. AnyRef
  36. 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 LkDiHyperEdge(nodes: Product)

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 LkDiHyperEdge[N] to any2stringadd[LkDiHyperEdge[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): (LkDiHyperEdge[N], B)
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to ArrowAssoc[LkDiHyperEdge[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
    LEdge
  21. def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqDiHyperEq
  22. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqDiHyperEq
  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): HyperEdge[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
    HyperEdgeEdgeCopy
  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 directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

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

    Synonym for source.

    Synonym for source.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  65. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  66. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  67. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def grouped(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  69. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  70. 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
    DiHyperEdgeLikeEdgeLike
  71. 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
    DiHyperEdgeLikeEdgeLike
  72. 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
    DiHyperEdgeLikeEdgeLike
  73. 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
    DiHyperEdgeLikeEdgeLike
  74. def hashCode(): Int
    Definition Classes
    LkEdge → AnyRef → Any
  75. def head: N
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  76. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def init: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def inits: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  79. 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
    HyperEdgeEdgeLike
  80. 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
    HyperEdgeEdgeLike
  81. def isDefined: Boolean
    Definition Classes
    Param
  82. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  83. def isEdge: Boolean
    Definition Classes
    EdgeParam
  84. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  85. 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
    EdgeLike
  86. def isIn: Boolean
    Definition Classes
    InParamParam
  87. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  88. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  89. 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
  90. def isNode: Boolean
    Definition Classes
    EdgeParam
  91. def isOut: Boolean
    Definition Classes
    InParamParam
  92. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  93. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  94. 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
    HyperEdgeEdgeLike
  95. 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
  96. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  97. def iterator: Iterator[N]

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

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

    Definition Classes
    HyperEdgeEdgeLike → IterableLike → GenIterableLike
  98. def label: L1
    Definition Classes
    LEdge
  99. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  102. 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
    DiHyperEdgeLikeEdgeLike
  103. 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
    DiHyperEdgeLikeEdgeLike
  104. final def matches(fList: List[(N) ⇒ Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    HyperEdge
  105. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. val n1: LkDiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to EdgeAssoc[LkDiHyperEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  113. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  114. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  115. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[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
  116. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  117. val nodes: Product
    Definition Classes
    HyperEdgeEdgeLike
  118. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  119. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    DiHyperEdgeLikeEdgeLike
  120. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  121. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. 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()
  123. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  124. final def notify(): Unit
    Definition Classes
    AnyRef
  125. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  126. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  127. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  128. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  129. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[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
  130. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  133. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  136. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  139. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  140. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  142. 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.

  143. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  144. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  146. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  147. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  148. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  149. 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()
  150. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

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

    All target ends of this edge.

    All target ends of this edge.

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

    Synonym for target.

    Synonym for target.

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

  187. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  188. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  189. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  190. 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.

  191. val value: LkDiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  192. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  193. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  194. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  195. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  196. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  197. def weight: Long

    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.

    Definition Classes
    EdgeLike
  198. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  199. 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
    DiHyperEdgeLikeEdgeLike
  200. 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
    DiHyperEdgeLikeEdgeLike
  201. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  202. 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
  203. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  204. def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  205. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to EdgeAssoc[LkDiHyperEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  206. def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  207. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to EdgeAssoc[LkDiHyperEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  208. def [B](y: B): (LkDiHyperEdge[N], B)
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to ArrowAssoc[LkDiHyperEdge[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 LkDiHyperEdge[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:
    (lkDiHyperEdge: 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 LkDiHyperEdge[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:
    (lkDiHyperEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).isDefined
    Definition Classes
    Param
  4. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).isEdge
    Definition Classes
    NodeParam
  5. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).isIn
    Definition Classes
    InParamParam
  6. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).isOut
    Definition Classes
    InParamParam
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[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:
    (lkDiHyperEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[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:
    (lkDiHyperEdge: OuterNode[LkDiHyperEdge[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 LkDiHyperEdge[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:
    (lkDiHyperEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from LkEdge[N]

Inherited from Keyed

Inherited from LDiHyperEdge[N]

Inherited from DiHyperEdgeLike[N]

Inherited from EqDiHyper

Inherited from LHyperEdge[N]

Inherited from LEdge[N]

Inherited from HyperEdge[N]

Inherited from EqHyper

Inherited from OuterEdge[N, LkDiHyperEdge]

Inherited from EdgeParam

Inherited from InParam[N, LkDiHyperEdge]

Inherited from Param[N, LkDiHyperEdge]

Inherited from EdgeCopy[HyperEdge]

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 LkDiHyperEdge[N] to OuterNode[LkDiHyperEdge[N]]

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

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

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

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

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

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

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

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

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

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

Ungrouped