object WeightOrdering extends Ordering[EdgeT]
Type Members
- class OrderingOps extends AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def compare(e1: EdgeT, e2: EdgeT): Int
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def equiv(x: EdgeT, y: EdgeT): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def gt(x: EdgeT, y: EdgeT): Boolean
- def gteq(x: EdgeT, y: EdgeT): Boolean
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def isReverseOf(other: Ordering[_]): Boolean
- def lt(x: EdgeT, y: EdgeT): Boolean
- def lteq(x: EdgeT, y: EdgeT): Boolean
- def max[U <: EdgeT](x: U, y: U): U
- def min[U <: EdgeT](x: U, y: U): U
- implicit def mkOrderingOps(lhs: EdgeT): OrderingOps
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def on[U](f: (U) => EdgeT): Ordering[U]
- def orElse(other: Ordering[EdgeT]): Ordering[EdgeT]
- def orElseBy[S](f: (EdgeT) => S)(implicit ord: Ordering[S]): Ordering[EdgeT]
- def reverse: Ordering[EdgeT]
- def reversed(): Comparator[EdgeT]
- final def synchronized[T0](arg0: => T0): T0
- def thenComparing[U <: Comparable[_ >: U <: AnyRef]](arg0: Function[_ >: EdgeT <: AnyRef, _ <: U]): Comparator[EdgeT]
- def thenComparing[U <: AnyRef](arg0: Function[_ >: EdgeT <: AnyRef, _ <: U], arg1: Comparator[_ >: U <: AnyRef]): Comparator[EdgeT]
- def thenComparing(arg0: Comparator[_ >: EdgeT <: AnyRef]): Comparator[EdgeT]
- def thenComparingDouble(arg0: ToDoubleFunction[_ >: EdgeT <: AnyRef]): Comparator[EdgeT]
- def thenComparingInt(arg0: ToIntFunction[_ >: EdgeT <: AnyRef]): Comparator[EdgeT]
- def thenComparingLong(arg0: ToLongFunction[_ >: EdgeT <: AnyRef]): Comparator[EdgeT]
- def toString(): String
- def tryCompare(x: EdgeT, y: EdgeT): Some[Int]
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Deprecated Value Members
- def finalize(): Unit
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.