trait GraphDegree[N, E[+X] <: EdgeLikeIn[X]] extends AnyRef
A trait for graph degree calculations.
- N
the user type of the nodes (vertices) in this graph.
- E
the kind of the edges (links) in this graph.
- Self Type
- GraphDegree[N, E] with GraphBase[N, E]
- Alphabetic
- By Inheritance
- GraphDegree
- AnyRef
- Any
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Type Members
- trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
- type DegreeNodeSeqEntry = (Int, (GraphDegree.this)#NodeT)
Type alias for entries in degree maps returned by
degreeSeqMap. - final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
Decreasing ordering of nodes with respect to their degree.
- trait Filter[T] extends (T) => Boolean
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[N, E] toany2stringadd[GraphDegree[N, E]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (GraphDegree[N, E], B)
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toArrowAssoc[GraphDegree[N, E]] 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 degreeCount(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, Int]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are the number of inner nodes having the degree of the corresponding key.
- def degreeNodeSeq(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[(GraphDegree.this)#DegreeNodeSeqEntry]
The degree sequence of this graph projected onto a sequence of tuples.
The degree sequence of this graph projected onto a sequence of tuples. The first elements of the tuples are the degrees in non-increasing order while the second elements are the corresponding inner nodes.
- def degreeNodesMap(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, AnySet[(GraphDegree.this)#NodeT]]
The degree set of this graph projected onto a map.
The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are sets of the corresponding inner nodes.
- def degreeSeq(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[Int]
The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.
- def degreeSet(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedSet[Int]
The degree set of this graph, that is the decreasing set of unique degrees over all nodes.
The degree set of this graph, that is the decreasing set of unique degrees over all nodes. Same as degreeSeq without duplicates.
- def ensuring(cond: (GraphDegree[N, E]) => Boolean, msg: => Any): GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toEnsuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (GraphDegree[N, E]) => Boolean): GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toEnsuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toEnsuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toEnsuring[GraphDegree[N, E]] 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
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def maxDegree(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The degree of the node having the highest degree or
0if this graph is empty. - def minDegree(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The degree of the node having the least degree or
0if this graph is empty. - 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 pipe[B](f: (GraphDegree[N, E]) => B): B
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toChainingOps[GraphDegree[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- val self: GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toChainingOps[GraphDegree[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: (GraphDegree[N, E]) => U): GraphDegree[N, E]
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toChainingOps[GraphDegree[N, E]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def toString(): String
- Definition Classes
- AnyRef → Any
- def totalDegree(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int
The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.The total degree of this graph equaling to the sum of the degrees over all nodes or
0if this graph is empty.- nodeDegree
the degree function to apply to the nodes defaulting to
Degree. Non-default predefined degree functions areInDegreeandOutDegree.- degreeFilter
selects nodes to be included by their degree.
- 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])
- object Degree extends (GraphDegree.this)#DegreeFunction
- object DegreeOrdering extends Serializable
- object InDegree extends (GraphDegree.this)#DegreeFunction
- object IntReverseOrdering extends Ordering[Int]
Decreasing ordering of integers.
- object OutDegree extends (GraphDegree.this)#DegreeFunction
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[N, E] toStringFormat[GraphDegree[N, E]] 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[N, E], B)
- Implicit
- This member is added by an implicit conversion from GraphDegree[N, E] toArrowAssoc[GraphDegree[N, E]] 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.