Trait

scalax.collection

GraphDegree

Related Doc: package collection

Permalink

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
AdjacencyListBase, AdjacencyListGraph, AdjacencyListGraph, DefaultGraphImpl, DefaultGraphImpl, Graph, Graph, Graph, GraphLike, GraphLike
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphDegree
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

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

    Permalink

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

    Permalink

    Type alias for entries in degree maps returned by degreeSeqMap.

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

    Permalink

    Decreasing ordering of nodes with respect to their degree.

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

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to any2stringadd[GraphDegree[N, E]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (GraphDegree[N, E], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to ArrowAssoc[GraphDegree[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  7. object DegreeOrdering extends Serializable

    Permalink

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

    Permalink

  9. object IntReverseOrdering extends Ordering[Int]

    Permalink

    Decreasing ordering of integers.

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

    Permalink

  11. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  12. def clone(): AnyRef

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

    Permalink

    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[(GraphDegree.this)#DegreeNodeSeqEntry]

    Permalink

    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, AnySet[(GraphDegree.this)#NodeT]]

    Permalink

    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]

    Permalink

    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]

    Permalink

    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. def ensuring(cond: (GraphDegree[N, E]) ⇒ Boolean, msg: ⇒ Any): GraphDegree[N, E]

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  19. def ensuring(cond: (GraphDegree[N, E]) ⇒ Boolean): GraphDegree[N, E]

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  20. def ensuring(cond: Boolean, msg: ⇒ Any): GraphDegree[N, E]

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  21. def ensuring(cond: Boolean): GraphDegree[N, E]

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  23. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  24. def finalize(): Unit

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

  25. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to StringFormat[GraphDegree[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  27. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  28. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink

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

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

    Permalink

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

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

    Permalink
    Definition Classes
    AnyRef

  32. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  33. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  35. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

    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.

  37. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  40. def →[B](y: B): (GraphDegree[N, E], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to ArrowAssoc[GraphDegree[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from GraphDegree[N, E] to any2stringadd[GraphDegree[N, E]]

Inherited by implicit conversion StringFormat from GraphDegree[N, E] to StringFormat[GraphDegree[N, E]]

Inherited by implicit conversion Ensuring from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]]

Inherited by implicit conversion ArrowAssoc from GraphDegree[N, E] to ArrowAssoc[GraphDegree[N, E]]

Ungrouped