scalax.collection

GraphDegree

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]
Linear Supertypes
AnyRef, Any
Known Subclasses
AdjacencyListGraph, AdjacencyListGraph, DefaultGraphImpl, DefaultGraphImpl, Graph, Graph, Graph, GraphLike, GraphLike
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphDegree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

  2. type DegreeNodeSeqEntry = (Int, (GraphDegree.this)#NodeT)

    Type alias for entries in degree maps returned by degreeSeqMap.

  3. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

    Decreasing ordering of nodes with respect to their degree.

  4. trait Filter[T] extends (T) ⇒ Boolean

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. object Degree extends (GraphDegree.this)#DegreeFunction

  7. object DegreeOrdering extends Serializable

  8. object InDegree extends (GraphDegree.this)#DegreeFunction

  9. object IntReverseOrdering extends Ordering[Int]

    Decreasing ordering of integers.

  10. object OutDegree extends (GraphDegree.this)#DegreeFunction

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  12. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  13. 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.

  14. def degreeNodeSeq(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Seq[(Int, (GraphDegree.this)#NodeT)]

    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.

  15. def degreeNodesMap(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, Set[(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.

  16. 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.

  17. 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.

  18. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  20. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  21. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  22. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  23. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  24. def maxDegree(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int

    The degree of the node having the highest degree or 0 if this graph is empty.

  25. def minDegree(implicit nodeDegree: (GraphDegree.this)#DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int

    The degree of the node having the least degree or 0 if this graph is empty.

  26. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  27. final def notify(): Unit

    Definition Classes
    AnyRef

  28. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  30. def toString(): String

    Definition Classes
    AnyRef → Any

  31. 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 0 if this graph is empty.

    The total degree of this graph equaling to the sum of the degrees over all nodes or 0 if this graph is empty.

    nodeDegree

    the degree function to apply to the nodes defaulting to Degree. Non-default predefined degree functions are InDegree and OutDegree.

    degreeFilter

    selects nodes to be included by their degree.

  32. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  34. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any

Ungrouped