final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
Decreasing ordering of nodes with respect to their degree.
Linear Supertypes
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- DegreeOrdering
- Ordering
- PartialOrdering
- Equiv
- Serializable
- Comparator
- AnyRef
- Any
Implicitly
- by EdgeAssoc
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new DegreeOrdering(f: (GraphDegree.this)#DegreeFunction)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toany2stringadd[(GraphDegree.this)#DegreeOrdering] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): ((GraphDegree.this)#DegreeOrdering, B)
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toArrowAssoc[(GraphDegree.this)#DegreeOrdering] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def compare(n1: (GraphDegree.this)#NodeT, n2: (GraphDegree.this)#NodeT): Int
- Definition Classes
- DegreeOrdering → Ordering → Comparator
- def ensuring(cond: ((GraphDegree.this)#DegreeOrdering) => Boolean, msg: => Any): (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEnsuring[(GraphDegree.this)#DegreeOrdering] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: ((GraphDegree.this)#DegreeOrdering) => Boolean): (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEnsuring[(GraphDegree.this)#DegreeOrdering] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEnsuring[(GraphDegree.this)#DegreeOrdering] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEnsuring[(GraphDegree.this)#DegreeOrdering] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def equiv(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean
- Definition Classes
- Ordering → PartialOrdering → Equiv
- val f: (GraphDegree.this)#DegreeFunction
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def gt(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean
- Definition Classes
- Ordering → PartialOrdering
- def gteq(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean
- Definition Classes
- Ordering → PartialOrdering
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isReverseOf(other: Ordering[_]): Boolean
- Definition Classes
- Ordering
- def lt(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean
- Definition Classes
- Ordering → PartialOrdering
- def lteq(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean
- Definition Classes
- Ordering → PartialOrdering
- def max[U <: (GraphDegree.this)#NodeT](x: U, y: U): U
- Definition Classes
- Ordering
- def min[U <: (GraphDegree.this)#NodeT](x: U, y: U): U
- Definition Classes
- Ordering
- implicit def mkOrderingOps(lhs: (GraphDegree.this)#NodeT): OrderingOps
- Definition Classes
- Ordering
- val n1: (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEdgeAssoc[(GraphDegree.this)#DegreeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def on[U](f: (U) => (GraphDegree.this)#NodeT): Ordering[U]
- Definition Classes
- Ordering
- def orElse(other: Ordering[(GraphDegree.this)#NodeT]): Ordering[(GraphDegree.this)#NodeT]
- Definition Classes
- Ordering
- def orElseBy[S](f: ((GraphDegree.this)#NodeT) => S)(implicit ord: Ordering[S]): Ordering[(GraphDegree.this)#NodeT]
- Definition Classes
- Ordering
- def pipe[B](f: ((GraphDegree.this)#DegreeOrdering) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toChainingOps[(GraphDegree.this)#DegreeOrdering] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- def reverse: Ordering[(GraphDegree.this)#NodeT]
- Definition Classes
- Ordering → PartialOrdering
- def reversed(): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- val self: (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toChainingOps[(GraphDegree.this)#DegreeOrdering] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: ((GraphDegree.this)#DegreeOrdering) => U): (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toChainingOps[(GraphDegree.this)#DegreeOrdering] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def thenComparing[U <: Comparable[_ >: U <: AnyRef]](arg0: Function[_ >: (GraphDegree.this)#NodeT <: AnyRef, _ <: U]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def thenComparing[U <: AnyRef](arg0: Function[_ >: (GraphDegree.this)#NodeT <: AnyRef, _ <: U], arg1: Comparator[_ >: U <: AnyRef]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def thenComparing(arg0: Comparator[_ >: (GraphDegree.this)#NodeT <: AnyRef]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def thenComparingDouble(arg0: ToDoubleFunction[_ >: (GraphDegree.this)#NodeT <: AnyRef]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def thenComparingInt(arg0: ToIntFunction[_ >: (GraphDegree.this)#NodeT <: AnyRef]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def thenComparingLong(arg0: ToLongFunction[_ >: (GraphDegree.this)#NodeT <: AnyRef]): Comparator[(GraphDegree.this)#NodeT]
- Definition Classes
- Comparator
- def toString(): String
- Definition Classes
- AnyRef → Any
- def tryCompare(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Some[Int]
- Definition Classes
- Ordering → PartialOrdering
- val value: (GraphDegree.this)#DegreeOrdering
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEdgeAssoc[(GraphDegree.this)#DegreeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def ~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toEdgeAssoc[(GraphDegree.this)#DegreeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Shadowed Implicit Value Members
- def toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toOuterNode[(GraphDegree.this)#DegreeOrdering] 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:(degreeOrdering: OuterNode[(GraphDegree.this)#DegreeOrdering]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toStringFormat[(GraphDegree.this)#DegreeOrdering] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): ((GraphDegree.this)#DegreeOrdering, B)
- Implicit
- This member is added by an implicit conversion from (GraphDegree.this)#DegreeOrdering toArrowAssoc[(GraphDegree.this)#DegreeOrdering] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.