scalax.collection.edge

WHyperEdge

class WHyperEdge[N] extends HyperEdge[N] with WEdge[N] with EdgeCopy[WHyperEdge] with OuterEdge[N, WHyperEdge]

weighted, undirected hyperedge.

Annotations
@SerialVersionUID( 70L )
Linear Supertypes
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WHyperEdge
  2. WEdge
  3. HyperEdge
  4. EqHyper
  5. OuterEdge
  6. EdgeParam
  7. InParam
  8. Param
  9. EdgeCopy
  10. EdgeLike
  11. Serializable
  12. Serializable
  13. Eq
  14. Iterable
  15. IterableLike
  16. Equals
  17. GenIterable
  18. GenIterableLike
  19. Traversable
  20. GenTraversable
  21. GenericTraversableTemplate
  22. TraversableLike
  23. GenTraversableLike
  24. Parallelizable
  25. TraversableOnce
  26. GenTraversableOnce
  27. FilterMonadic
  28. HasNewBuilder
  29. AnyRef
  30. Any
Implicitly
  1. by anyToNode
  2. by traversable2ops
  3. by MonadOps
  4. by HyperEdgeAssoc
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by any2stringadd
  8. by any2stringfmt
  9. by any2ArrowAssoc
  10. by any2Ensuring
  11. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. type Self = Iterable[N]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

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

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

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  5. def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike
  7. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike
  8. def ->[B](y: B): (WHyperEdge[N], B)

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to ArrowAssoc[WHyperEdge[N]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  9. def /:[B](z: B)(op: (B, N) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :\[B](z: B)(op: (N, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  13. final def _1: N

    The first node.

    The first node. Same as _n(0).

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

    The second node.

    The second node. Same as _n(1).

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

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

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

    Definition Classes
    EdgeLike
  16. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. final def arity: Int

    Number of nodes linked by this Edge.

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

    Definition Classes
    EdgeLike
  21. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  22. def asParIterable: ParIterable[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  23. def asParSeq: ParSeq[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  24. def attributesToString: String

    Attributes
    protected
    Definition Classes
    WEdge
  25. def baseEquals(other: EdgeLike[_]): Boolean

    Attributes
    protected
    Definition Classes
    EqHyperEq
  26. def baseHashCode: Int

    Attributes
    protected
    Definition Classes
    EqHyperEq
  27. def brackets: Brackets

    Attributes
    protected
    Definition Classes
    EdgeLike
  28. def canEqual(that: Any): Boolean

    Definition Classes
    EdgeLike → IterableLike → Equals
  29. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  31. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]

    Definition Classes
    TraversableOnce
  32. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  33. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  34. def copy[NN](newNodes: Product): WHyperEdge[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
    WHyperEdgeHyperEdgeEdgeCopy
  35. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  36. def copyToArray[B >: N](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def copyToArray[B >: N](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def copyToBuffer[B >: N](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  39. def count(p: (N) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def directed: Boolean

    true it this edge is directed.

    true it this edge is directed.

    Definition Classes
    EdgeLike
  41. def drop(n: Int): Iterable[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  42. def dropRight(n: Int): Iterable[N]

    Definition Classes
    IterableLike
  43. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  44. val e: EdgeLikeIn[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  45. def edge: WHyperEdge[N]

    Definition Classes
    OuterEdge
  46. def edgeParams: Iterable[EdgeParam]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  47. val elems: Iterable[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  48. def ensuring(cond: (WHyperEdge[N]) ⇒ Boolean, msg: ⇒ Any): WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to Ensuring[WHyperEdge[N]] performed by method any2Ensuring in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    Ensuring
  49. def ensuring(cond: (WHyperEdge[N]) ⇒ Boolean): WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to Ensuring[WHyperEdge[N]] performed by method any2Ensuring in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    Ensuring
  50. def ensuring(cond: Boolean, msg: ⇒ Any): WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to Ensuring[WHyperEdge[N]] performed by method any2Ensuring in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    Ensuring
  51. def ensuring(cond: Boolean): WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to Ensuring[WHyperEdge[N]] performed by method any2Ensuring in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    Ensuring
  52. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  53. def equals(other: EdgeLike[_]): Boolean

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Attributes
    protected
    Definition Classes
    EdgeLike
  54. def equals(other: Any): Boolean

    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  55. def exists(p: (N) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def filter(p: (N) ⇒ Boolean): Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  57. def filterNot(p: (N) ⇒ Boolean): Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  58. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  59. def find(p: (N) ⇒ Boolean): Option[N]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  60. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  61. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate
  62. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def foldRight[B](z: B)(op: (N, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  65. def forall(p: (N) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  66. def foreach[U](f: (N) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  67. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  68. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
  69. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  70. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]

    Definition Classes
    TraversableLike → GenTraversableLike
  71. def grouped(size: Int): Iterator[Iterable[N]]

    Definition Classes
    IterableLike
  72. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  73. 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
    HyperEdgeEdgeLike
  74. 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
    HyperEdgeEdgeLike
  75. 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
    HyperEdgeEdgeLike
  76. 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
    HyperEdgeEdgeLike
  77. def hashCode(): Int

    Definition Classes
    EdgeLike → AnyRef → Any
  78. def head: N

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  79. def headOption: Option[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  80. def ifParSeq[R](isbody: (ParSeq[N]) ⇒ R): (TraversableOps[N])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  81. def init: Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  82. def inits: Iterator[Iterable[N]]

    Definition Classes
    TraversableLike
  83. 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
  84. 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
  85. def isDefined: Boolean

    Definition Classes
    Param
  86. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  87. def isEdge: Boolean

    Definition Classes
    EdgeParam
  88. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  89. 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
  90. def isIn: Boolean

    Definition Classes
    InParamParam
  91. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  92. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  93. 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
  94. def isNode: Boolean

    Definition Classes
    EdgeParam
  95. def isOut: Boolean

    Definition Classes
    InParamParam
  96. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  97. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  98. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  99. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  100. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  101. 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
  102. 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
  103. def isValidCustomExceptionMessage: String

    Attributes
    protected
    Definition Classes
    EdgeLike
  104. 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
  105. def label: Any

    The label of this edge.

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

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

    Definition Classes
    EdgeLike
    Exceptions thrown
    UnsupportedOperationException

    if the edge is non-labeled.

  106. def last: N

    Definition Classes
    TraversableLike → GenTraversableLike
  107. def lastOption: Option[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  108. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  109. 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
    HyperEdgeEdgeLike
  110. 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
    HyperEdgeEdgeLike
  111. final def matches(fList: List[(N) ⇒ Boolean]): Boolean

    Attributes
    protected
    Definition Classes
    HyperEdge
  112. def max[B >: N](implicit cmp: Ordering[B]): N

    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N

    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def min[B >: N](implicit cmp: Ordering[B]): N

    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N

    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. val n1: WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to EdgeAssoc[WHyperEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  120. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  121. def newBuilder: Builder[N, Iterable[N]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  122. def nodeParams: Iterable[NodeParam[N]]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  123. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  124. def nodesToString: String

    Attributes
    protected
    Definition Classes
    EdgeLike
  125. def nodesToStringSeparator: String

    Attributes
    protected
    Definition Classes
    EdgeLike
  126. def nodesToStringWithParenthesis: Boolean

    Attributes
    protected
    Definition Classes
    EdgeLike
  127. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. 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()
  129. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  130. final def notify(): Unit

    Definition Classes
    AnyRef
  131. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  132. def par: ParIterable[N]

    Definition Classes
    Parallelizable
  133. def parCombiner: Combiner[N, ParIterable[N]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  134. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

    Definition Classes
    TraversableLike → GenTraversableLike
  135. lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  136. def product[B >: N](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def reduceLeft[B >: N](op: (B, N) ⇒ B): B

    Definition Classes
    TraversableOnce
  139. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def reduceRight[B >: N](op: (N, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  142. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def repr: Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  144. def reversed: List[N]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  145. def sameElements[B >: N](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  146. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  147. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  148. 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.

  149. def seq: Iterable[N]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  150. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def slice(from: Int, until: Int): Iterable[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  152. def sliding(size: Int, step: Int): Iterator[Iterable[N]]

    Definition Classes
    IterableLike
  153. def sliding(size: Int): Iterator[Iterable[N]]

    Definition Classes
    IterableLike
  154. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    EdgeLike
  155. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

    Definition Classes
    TraversableLike → GenTraversableLike
  156. def splitAt(n: Int): (Iterable[N], Iterable[N])

    Definition Classes
    TraversableLike → GenTraversableLike
  157. def stringPrefix: String

    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  158. def sum[B >: N](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  160. def tail: Iterable[N]

    Definition Classes
    TraversableLike → GenTraversableLike
  161. def tails: Iterator[Iterable[N]]

    Definition Classes
    TraversableLike
  162. def take(n: Int): Iterable[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  163. def takeRight(n: Int): Iterable[N]

    Definition Classes
    IterableLike
  164. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  165. def targets: Traversable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  166. def thisCollection: Iterable[N]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  167. final def thisSimpleClassName: String

    Attributes
    protected
    Definition Classes
    EdgeLike
  168. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  169. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def toBuffer[B >: N]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toCollection(repr: Iterable[N]): Iterable[N]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  172. def toInParams: Iterable[InParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  173. def toIndexedSeq: IndexedSeq[N]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toIterable: Iterable[N]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  175. def toIterator: Iterator[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  176. def toList: List[N]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def toOuterEdges: Iterable[E[N]]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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 toOuterNodes: Iterable[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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
  180. def toParArray: ParArray[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to TraversableOps[N] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  181. def toSeq: Seq[N]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def toSet[B >: N]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def toStream: Stream[N]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  184. def toString(): String

    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  185. def toStringWithParenthesis: Boolean

    Attributes
    protected
    Definition Classes
    EdgeLike
  186. def toTraversable: Traversable[N]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  187. def toVector: Vector[N]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. 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.

  189. final def undirected: Boolean

    true it this edge is undirected.

    true it 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: WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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

    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
    WHyperEdgeEdgeLike
  200. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]

    Definition Classes
    TraversableLike → FilterMonadic
  201. 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
    HyperEdgeEdgeLike
  202. 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
    HyperEdgeEdgeLike
  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 information
    This member is added by an implicit conversion from WHyperEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  207. def ~[N >: N1](n2: N): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to EdgeAssoc[WHyperEdge[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 information
    This member is added by an implicit conversion from WHyperEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  209. def ~>[N >: N1](n2: N): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to EdgeAssoc[WHyperEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  210. def [B](y: B): (WHyperEdge[N], B)

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

Shadowed Implicit Value Members

  1. def filter(p: (N) ⇒ Boolean): TraversableOnce[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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:
    (wHyperEdge: MonadOps[N]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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:
    (wHyperEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).isDefined
    Definition Classes
    Param
  4. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).isEdge
    Definition Classes
    NodeParam
  5. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).isIn
    Definition Classes
    InParamParam
  6. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).isOut
    Definition Classes
    InParamParam
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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:
    (wHyperEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. val self: Any

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (wHyperEdge: StringAdd).self
    Definition Classes
    StringAdd
  10. val self: Any

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (wHyperEdge: StringFormat).self
    Definition Classes
    StringFormat
  11. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  12. def toString(): String

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to OuterNode[WHyperEdge[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:
    (wHyperEdge: OuterNode[WHyperEdge[N]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  13. def withFilter(p: (N) ⇒ Boolean): Iterator[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[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:
    (wHyperEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:\[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to ArrowAssoc[WHyperEdge[N]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (wHyperEdge: ArrowAssoc[WHyperEdge[N]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: WHyperEdge[N]

    Implicit information
    This member is added by an implicit conversion from WHyperEdge[N] to Ensuring[WHyperEdge[N]] performed by method any2Ensuring in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    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:
    (wHyperEdge: Ensuring[WHyperEdge[N]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from WEdge[N]

Inherited from HyperEdge[N]

Inherited from EqHyper

Inherited from OuterEdge[N, WHyperEdge]

Inherited from EdgeParam

Inherited from InParam[N, WHyperEdge]

Inherited from Param[N, WHyperEdge]

Inherited from EdgeCopy[WHyperEdge]

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

Inherited by implicit conversion traversable2ops from WHyperEdge[N] to TraversableOps[N]

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

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

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

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

Inherited by implicit conversion any2stringadd from WHyperEdge[N] to StringAdd

Inherited by implicit conversion any2stringfmt from WHyperEdge[N] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from WHyperEdge[N] to ArrowAssoc[WHyperEdge[N]]

Inherited by implicit conversion any2Ensuring from WHyperEdge[N] to Ensuring[WHyperEdge[N]]

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

Ungrouped