EdgeBase

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

final def asInstanceOf[T0]: T0

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]

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 drop(n: Int): Iterable[NodeT]

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

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

val edge: E[NodeT]

The outer edge after transformation by means of the copy method.

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]

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

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

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 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 hashCode(): Int

def head: NodeT

def headOption: Option[NodeT]

def init: Iterable[NodeT]

def inits: Iterator[Iterable[NodeT]]

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

def isEdge: Boolean

def isEmpty: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[NodeT]

def last: NodeT

def lastOption: Option[NodeT]

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

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[NodeT, Iterable[NodeT]]

final def nodes: Iterable[NodeT]

The inner nodes incident with this inner edge.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[NodeT]

def parCombiner: Combiner[NodeT, ParIterable[NodeT]]

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

def privateNodes: Set[NodeT]

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

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

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

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

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

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

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

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

def repr: Iterable[NodeT]

def reversed: List[NodeT]

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

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

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

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

def seq: Iterable[NodeT]

def size: Int

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

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

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

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

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

def stringPrefix: String

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

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

def tail: Iterable[NodeT]

def tails: Iterator[Iterable[NodeT]]

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

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

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

def thisCollection: Iterable[NodeT]

def to: NodeT

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

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

def toBuffer[B >: NodeT]: Buffer[B]

def toCollection(repr: Iterable[NodeT]): Iterable[NodeT]

def toEdgeIn: E[N]

Reconstructs the outer edge by means of the copymethod.

final def toEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (EdgeT) ⇒ GraphPredef.EdgeOut.toEdgeT.G.EdgeT): GraphPredef.EdgeOut.toEdgeT.G.EdgeT

def toIndexedSeq: IndexedSeq[NodeT]

def toIterable: Iterable[NodeT]

def toIterator: Iterator[NodeT]

def toList: List[NodeT]

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

def toSeq: Seq[NodeT]

def toSet[B >: NodeT]: Set[B]

def toStream: Stream[NodeT]

def toString(): String

def toTraversable: Traversable[NodeT]

def toVector: Vector[NodeT]

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

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

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

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

def view: IterableView[NodeT, Iterable[NodeT]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

final def ~~: Set[EdgeT]

Synonym for adjacents.

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