InnerEdge

Type Members

type Self = Iterable[NodeT]

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

Definition Classes
TraversableLike

Abstract Value Members

abstract def edge: E[NodeT]

The outer edge after transformation by means of the copy method.
The outer edge after transformation by means of the copy method. This edge contains references to inner nodes while the original outer edge contained references to outer nodes.

Definition Classes
InnerEdge → InnerEdgeParam
abstract def iterator: Iterator[NodeT]

Definition Classes
IterableLike → GenIterableLike

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

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

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

Definition Classes
TraversableLike
def ->[B](y: B): (InnerEdge, B)

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

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

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

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

Definition Classes
Any
def addString(b: StringBuilder): StringBuilder

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

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

Definition Classes
TraversableOnce
def adjacents: Set[EdgeT]

All connecting edges, that is all edges at any of the nodes incident with this edge.
All connecting edges, that is all edges at any of the nodes incident with this edge.
returns
set of connecting edges including hooks.
def aggregate[B](z: B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
final def asEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT

Attributes
protected[scalax.collection]
Definition Classes
InnerEdgeParam
final def asEdgeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: EdgeT

Attributes
protected[scalax.collection]
Definition Classes
InnerEdgeParam
final def asInstanceOf[T0]: T0

Definition Classes
Any
def asParIterable: ParIterable[NodeT]

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

Implicit information
This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
Definition Classes
TraversableOps
def canEqual(that: Any): Boolean

Definition Classes
InnerEdge → IterableLike → Equals
def clone(): AnyRef

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

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

Definition Classes
TraversableOnce
def companion: GenericCompanion[Iterable]

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

Same as isAt.
Same as isAt.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Annotations
@inline()
def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit

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

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

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

Definition Classes
TraversableOnce
def count(p: (NodeT) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def directed: Boolean

true it this edge is directed.
true it this edge is directed.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def drop(n: Int): Iterable[NodeT]

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

Definition Classes
IterableLike
def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

Definition Classes
TraversableLike → GenTraversableLike
def edgeParams: Iterable[EdgeParam]

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

Implicit information
This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
Definition Classes
Partitions
def ensuring(cond: (InnerEdge) ⇒ Boolean, msg: ⇒ Any): InnerEdge

Implicit information
This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (InnerEdge) ⇒ Boolean): InnerEdge

Implicit information
This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdge

Implicit information
This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): InnerEdge

Implicit information
This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(other: Any): Boolean

Definition Classes
InnerEdge → Equals → AnyRef → Any
def exists(p: (NodeT) ⇒ Boolean): Boolean

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

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

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

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

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

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

Definition Classes
GenericTraversableTemplate
final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T

Definition Classes
InnerEdgeParam
def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (NodeT) ⇒ Boolean): Boolean

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

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

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

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

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

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

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hasSource(pred: (NodeT) ⇒ Boolean): Boolean

true if any source end of this edge fulfills pred.
true if any source end of this edge fulfills pred.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def hasSource[M >: N](node: M): Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def hasTarget(pred: (NodeT) ⇒ Boolean): Boolean

true if any target end of this edge fulfills pred.
true if any target end of this edge fulfills pred.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def hasTarget[M >: N](node: M): Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def hashCode(): Int

Definition Classes
InnerEdge → AnyRef → Any
def head: NodeT

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[NodeT]

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

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

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Iterable[NodeT]]

Definition Classes
TraversableLike
def isAt(pred: (NodeT) ⇒ Boolean): Boolean

true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def isAt[M >: N](node: M): Boolean

true if node is incident with this edge.
true if node is incident with this edge.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
final def isContaining[N <: N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

Definition Classes
InnerEdgeParam
def isDefined: Boolean

Definition Classes
Param
final def isDirected: Boolean

Same as directed.
Same as directed.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Annotations
@inline()
def isEdge: Boolean

Definition Classes
EdgeParam
def isEmpty: Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def isHyperEdge: Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def isIn: Boolean

Definition Classes
OutParam → Param
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLabeled: Boolean

true if this edge is labeled.
true if this edge is labeled. See also label.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def isLooping: Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def isNode: Boolean

Definition Classes
EdgeParam
def isOut: Boolean

Definition Classes
OutParam → Param
def isParIterable: Boolean

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

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

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

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

Same as undirected.
Same as undirected.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Annotations
@inline()
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.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Exceptions thrown
UnsupportedOperationException
if the edge is non-labeled.
def last: NodeT

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[NodeT]

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

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def matches(p1: (NodeT) ⇒ Boolean, p2: (NodeT) ⇒ Boolean): Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def matches[M >: N](n1: M, n2: M): Boolean

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

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
val n1: InnerEdge

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

Definition Classes
AnyRef
def newBuilder: Builder[NodeT, Iterable[NodeT]]

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

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

Sequence of the end points of this edge.
Sequence of the end points of this edge.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
final def nodes: Iterable[NodeT]

The inner nodes incident with this inner edge.
The inner nodes incident with this inner edge. This is just a synonym to this that extends Iterable[NodeT].

Annotations
@inline()
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def nonHyperEdge: Boolean

true if this edge has exactly two ends.
true if this edge has exactly two ends.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Annotations
@inline()
final def nonLooping: Boolean

Same as ! looping.
Same as ! looping.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def par: ParIterable[NodeT]

Definition Classes
Parallelizable
def parCombiner: Combiner[NodeT, ParIterable[NodeT]]

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

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

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

Finds nodes of this edge which only participate in this edge.
Finds nodes of this edge which only participate in this edge.
returns
those nodes of this edge which do not participate in any other edge
def product[B >: NodeT](implicit num: Numeric[B]): B

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

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

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Iterable[NodeT]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[NodeT]

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

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

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

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def seq: Iterable[NodeT]

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

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

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

Definition Classes
IterableLike
def sliding(size: Int): Iterator[Iterable[NodeT]]

Definition Classes
IterableLike
def sources: Traversable[NodeT]

All source ends of this edge.
All source ends of this edge.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

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

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Definition Classes
InnerEdge → InnerEdgeParam → TraversableLike → GenTraversableLike
def sum[B >: NodeT](implicit num: Numeric[B]): B

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

Definition Classes
AnyRef
def tail: Iterable[NodeT]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Iterable[NodeT]]

Definition Classes
TraversableLike
def take(n: Int): Iterable[NodeT]

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

Definition Classes
IterableLike
def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def targets: Traversable[NodeT]

All target ends of this edge.
All target ends of this edge.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def thisCollection: Iterable[NodeT]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def to: NodeT
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: NodeT]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Iterable[NodeT]): Iterable[NodeT]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
final def toEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (EdgeT) ⇒ GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT

Definition Classes
InnerEdgeParam
def toInParams: Iterable[InParam[N, E]]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[NodeT]

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[NodeT]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toList: List[NodeT]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toOuter: E[N]

Reconstructs the outer edge by means of the copy method.
def toOuterEdges: Iterable[E[N]]

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: NodeT]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[NodeT]

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

Definition Classes
InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any
def toTraversable: Traversable[NodeT]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toVector: Vector[NodeT]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
final def undirected: Boolean

true it this edge is undirected.
true it this edge is undirected.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
Annotations
@inline()
def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

Definition Classes
GenericTraversableTemplate
val value: InnerEdge

Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
OuterNode → NodeParam
def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]

Definition Classes
IterableLike → TraversableLike
def view: IterableView[NodeT, Iterable[NodeT]]

Definition Classes
IterableLike → TraversableLike
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
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.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]

Definition Classes
TraversableLike → FilterMonadic
def withSources[U](f: (NodeT) ⇒ 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.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def withTargets[U](f: (NodeT) ⇒ 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.

Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Definition Classes
EdgeLike
def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike
def ~[N >: N1](n2: N): UnDiEdge[N]

Implicit information
This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()
def ~>[N >: N1](n2: N): DiEdge[N]

Implicit information
This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()
final def ~~: Set[EdgeT]

Synonym for adjacents.
Synonym for adjacents.

Annotations
@inline()
def →[B](y: B): (InnerEdge, B)

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

Shadowed Implicit Value Members

def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).++(that)(bf)
Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).++:(that)(bf)
Definition Classes
TraversableLike
def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).++:(that)(bf)
Definition Classes
TraversableLike
def /:[B](z: B)(op: (B, NodeT) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT])./:(z)(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (NodeT, B) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).:\(z)(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def addString(b: StringBuilder): StringBuilder
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).addString(b)
Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).addString(b, sep)
Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).addString(b, start, sep, end)
Definition Classes
TraversableOnce
def aggregate[B](z: B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).aggregate(z)(seqop, combop)
Definition Classes
TraversableOnce → GenTraversableOnce
def canEqual(that: Any): Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).canEqual(that)
Definition Classes
EdgeLike → IterableLike → Equals
def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).collect(pf)(bf)
Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).collectFirst(pf)
Definition Classes
TraversableOnce
def companion: GenericCompanion[Iterable]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).companion
Definition Classes
Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).copyToArray(xs, start, len)
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: NodeT](xs: Array[B]): Unit
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).copyToArray(xs)
Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).copyToArray(xs, start)
Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).copyToBuffer(dest)
Definition Classes
TraversableOnce
def count(p: (NodeT) ⇒ Boolean): Int
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).count(p)
Definition Classes
TraversableOnce → GenTraversableOnce
def drop(n: Int): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).drop(n)
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).dropRight(n)
Definition Classes
IterableLike
def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).dropWhile(p)
Definition Classes
TraversableLike → GenTraversableLike
def edge: EdgeLike[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).edge
Definition Classes
OuterEdge
def equals(other: Any): Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).equals(other)
Definition Classes
EdgeLike → Equals → AnyRef → Any
def exists(p: (NodeT) ⇒ Boolean): Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).exists(p)
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (NodeT) ⇒ Boolean): TraversableOnce[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: MonadOps[NodeT]).filter(p)
Definition Classes
MonadOps
def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).filter(p)
Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).filterNot(p)
Definition Classes
TraversableLike → GenTraversableLike
def find(p: (NodeT) ⇒ Boolean): Option[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).find(p)
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def flatMap[B](f: (NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: MonadOps[NodeT]).flatMap(f)
Definition Classes
MonadOps
def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).flatMap(f)(bf)
Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten: Iterator[N]
Implicit information
This member is added by an implicit conversion from InnerEdge to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: FlattenOps[N]).flatten
Definition Classes
FlattenOps
def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).flatten(asTraversable)
Definition Classes
GenericTraversableTemplate
def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).fold(z)(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).foldLeft(z)(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).foldRight(z)(op)
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (NodeT) ⇒ Boolean): Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).forall(p)
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (NodeT) ⇒ U): Unit
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).foreach(f)
Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def genericBuilder[B]: Builder[B, Iterable[B]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).genericBuilder
Definition Classes
GenericTraversableTemplate
def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).groupBy(f)
Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).grouped(size)
Definition Classes
IterableLike
def hasDefiniteSize: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).hasDefiniteSize
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).hashCode()
Definition Classes
EdgeLike → AnyRef → Any
def head: NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).head
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).headOption
Definition Classes
TraversableLike → GenTraversableLike
def init: Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).init
Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).inits
Definition Classes
TraversableLike
def isDefined: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).isDefined
Definition Classes
Param
def isDefined: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isDefined
Definition Classes
Param
def isEdge: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).isEdge
Definition Classes
NodeParam
def isEdge: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isEdge
Definition Classes
EdgeParam
def isEmpty: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isEmpty
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def isIn: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).isIn
Definition Classes
InParam → Param
def isIn: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isIn
Definition Classes
InParam → Param
def isNode: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).isNode
Definition Classes
NodeParam
def isNode: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isNode
Definition Classes
EdgeParam
def isOut: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).isOut
Definition Classes
InParam → Param
def isOut: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isOut
Definition Classes
InParam → Param
final def isTraversableAgain: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).isTraversableAgain
Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def iterator: Iterator[NodeT]

Iterator for the nodes (end-points) of this edge.
Iterator for the nodes (end-points) of this edge.
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).iterator
Definition Classes
EdgeLike → IterableLike → GenIterableLike
def last: NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).last
Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).lastOption
Definition Classes
TraversableLike → GenTraversableLike
def map[B](f: (NodeT) ⇒ B): TraversableOnce[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: MonadOps[NodeT]).map(f)
Definition Classes
MonadOps
def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).map(f)(bf)
Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).max(cmp)
Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).maxBy(f)(cmp)
Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).min(cmp)
Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).minBy(f)(cmp)
Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).mkString
Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).mkString(sep)
Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).mkString(start, sep, end)
Definition Classes
TraversableOnce → GenTraversableOnce
def nodes: Product

The end nodes joined by this edge.
The end nodes joined by this edge.
Nodes will typically be represented by Tuples. Alternatively subclasses of Iterable implementing Product, such as List, may also be used. In the latter case be aware of higher memory footprint.
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).nodes
Definition Classes
EdgeLike
def nonEmpty: Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).nonEmpty
Definition Classes
TraversableOnce → GenTraversableOnce
def par: ParIterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).par
Definition Classes
Parallelizable
def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).partition(p)
Definition Classes
TraversableLike → GenTraversableLike
def product[B >: NodeT](implicit num: Numeric[B]): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).product(num)
Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduce(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduceLeft(op)
Definition Classes
TraversableOnce
def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduceLeftOption(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduceOption(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduceRight(op)
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).reduceRightOption(op)
Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).repr
Definition Classes
TraversableLike → GenTraversableLike
def sameElements[B >: NodeT](that: GenIterable[B]): Boolean
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).sameElements(that)
Definition Classes
IterableLike → GenIterableLike
def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).scan(z)(op)(cbf)
Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).scanLeft(z)(op)(bf)
Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).scanRight(z)(op)(bf)
Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
val self: Any
Implicit information
This member is added by an implicit conversion from InnerEdge 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:
(innerEdge: StringAdd).self
Definition Classes
StringAdd
val self: Any
Implicit information
This member is added by an implicit conversion from InnerEdge 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:
(innerEdge: StringFormat).self
Definition Classes
StringFormat
def seq: Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).seq
Definition Classes
Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).size
Definition Classes
TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).slice(from, until)
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).sliding(size, step)
Definition Classes
IterableLike
def sliding(size: Int): Iterator[Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).sliding(size)
Definition Classes
IterableLike
def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).span(p)
Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).splitAt(n)
Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).stringPrefix
Definition Classes
NodeParam
def stringPrefix: String
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).stringPrefix
Definition Classes
EdgeLike → TraversableLike → GenTraversableLike
def sum[B >: NodeT](implicit num: Numeric[B]): B
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).sum(num)
Definition Classes
TraversableOnce → GenTraversableOnce
def tail: Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).tail
Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).tails
Definition Classes
TraversableLike
def take(n: Int): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).take(n)
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).takeRight(n)
Definition Classes
IterableLike
def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).takeWhile(p)
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).to(cbf)
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toArray(arg0)
Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: NodeT]: Buffer[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toBuffer
Definition Classes
TraversableOnce → GenTraversableOnce
def toIndexedSeq: IndexedSeq[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toIndexedSeq
Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toIterable
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toIterator
Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toList: List[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toList
Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toMap(ev)
Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toSeq
Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: NodeT]: Set[B]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toSet
Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toStream
Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String
Implicit information
This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] 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:
(innerEdge: OuterNode[InnerEdge]).toString()
Definition Classes
NodeParam → AnyRef → Any
def toString(): String
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toString()
Definition Classes
EdgeLike → TraversableLike → AnyRef → Any
def toTraversable: Traversable[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toTraversable
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toVector: Vector[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).toVector
Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).transpose(asTraversable)
Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).unzip(asPair)
Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).unzip3(asTriple)
Definition Classes
GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).view(from, until)
Definition Classes
IterableLike → TraversableLike
def view: IterableView[NodeT, Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).view
Definition Classes
IterableLike → TraversableLike
def withFilter(p: (NodeT) ⇒ Boolean): Iterator[NodeT]
Implicit information
This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: MonadOps[NodeT]).withFilter(p)
Definition Classes
MonadOps
def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).withFilter(p)
Definition Classes
TraversableLike → FilterMonadic
def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).zip(that)(bf)
Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).zipAll(that, thisElem, thatElem)(bf)
Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT]).zipWithIndex(bf)
Definition Classes
IterableLike → GenIterableLike

Deprecated Value Members

def /:\[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
Implicit information
This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerEdge: E[NodeT])./:\(z)(op)
Definition Classes
GenTraversableOnce
Annotations
@deprecated
Deprecated
(Since version 2.10.0) use fold instead
def /:\[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
GenTraversableOnce
Annotations
@deprecated
Deprecated
(Since version 2.10.0) use fold instead
def toEdgeIn: E[N]

Annotations
@deprecated
Deprecated
(Since version 1.8.0) Use toOuter instead
def x: InnerEdge
Implicit information
This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] 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:
(innerEdge: ArrowAssoc[InnerEdge]).x
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.10.0) Use leftOfArrow instead
def x: InnerEdge
Implicit information
This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(innerEdge: Ensuring[InnerEdge]).x
Definition Classes
Ensuring
Annotations
@deprecated
Deprecated
(Since version 2.10.0) Use resultOfEnsuring instead

Inherited from InnerElem

Inherited from Edge

Inherited from Serializable

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

Inherited from EdgeParam

Inherited from OutParam[N, E]

Inherited from Param[N, E]

Inherited from Iterable[NodeT]

Inherited from IterableLike[NodeT, Iterable[NodeT]]

Inherited from Equals

Inherited from GenIterable[NodeT]

Inherited from GenIterableLike[NodeT, Iterable[NodeT]]

Inherited from Traversable[NodeT]

Inherited from GenTraversable[NodeT]

Inherited from GenericTraversableTemplate[NodeT, Iterable]

Inherited from TraversableLike[NodeT, Iterable[NodeT]]

Inherited from GenTraversableLike[NodeT, Iterable[NodeT]]

Inherited from Parallelizable[NodeT, ParIterable[NodeT]]

Inherited from TraversableOnce[NodeT]

Inherited from GenTraversableOnce[NodeT]

Inherited from FilterMonadic[NodeT, Iterable[NodeT]]

Inherited from HasNewBuilder[NodeT, Iterable[NodeT]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from InnerEdge to OuterNode[InnerEdge]

Inherited by implicit conversion traversable2ops from InnerEdge to TraversableOps[NodeT]

Inherited by implicit conversion MonadOps from InnerEdge to MonadOps[NodeT]

Inherited by implicit conversion flattenTraversableOnce from InnerEdge to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from InnerEdge to EdgeAssoc[InnerEdge]

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

Inherited by implicit conversion toEdge from InnerEdge to E[NodeT]

Inherited by implicit conversion any2stringadd from InnerEdge to StringAdd

Inherited by implicit conversion any2stringfmt from InnerEdge to StringFormat

Inherited by implicit conversion any2ArrowAssoc from InnerEdge to ArrowAssoc[InnerEdge]

Inherited by implicit conversion any2Ensuring from InnerEdge to Ensuring[InnerEdge]

Inherited by implicit conversion alternateImplicit from InnerEdge to ForceImplicitAmbiguity

Ungrouped

trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem

Type Members

type Self = Iterable[NodeT]

class WithFilter extends FilterMonadic[A, Repr]

Abstract Value Members

abstract def edge: E[NodeT]

abstract def iterator: Iterator[NodeT]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

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

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

def ->[B](y: B): (InnerEdge, B)

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

def adjacents: Set[EdgeT]

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

final def arity: Int

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

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

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[NodeT]

def asParSeq: ParSeq[NodeT]

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def count(p: (NodeT) ⇒ Boolean): Int

def directed: Boolean

def drop(n: Int): Iterable[NodeT]

def dropRight(n: Int): Iterable[NodeT]

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

def edgeParams: Iterable[EdgeParam]

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

def ensuring(cond: (InnerEdge) ⇒ Boolean, msg: ⇒ Any): InnerEdge

def ensuring(cond: (InnerEdge) ⇒ Boolean): InnerEdge

def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdge

def ensuring(cond: Boolean): InnerEdge

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def exists(p: (NodeT) ⇒ Boolean): Boolean

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

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

def finalize(): Unit

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

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

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

final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T

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

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

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

def forall(p: (NodeT) ⇒ Boolean): Boolean

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

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hasSource(pred: (NodeT) ⇒ Boolean): Boolean

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

def hasTarget(pred: (NodeT) ⇒ Boolean): Boolean

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

def hashCode(): Int

def head: NodeT