Packages

  • package root

    Welcome to the Graph for Scala API reference.

    Welcome to the Graph for Scala API reference. Some suggested navigation entry points:

    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection

    Contains the base traits and objects needed to use Graph for Scala.

    Contains the base traits and objects needed to use Graph for Scala.

    See also the Graph for Scala Core User Guide.

    Definition Classes
    scalax
  • package config
    Definition Classes
    collection
  • package edge

    Predefined edges.

    Predefined edges.

    While basic edge types are defined in the object GraphEdge, the predefined edges in this package cover the following categories (prefixes, shortcuts):

    weighted (W, %), key-weighted (Wk, %#), labeled (L, +), key-labeled (Lk, +#), weighted and labeled (WL, %+), key-weighted and labeled (WkL, %#+), weighted and key-labeled (WLk, %+#) and key-weighted and key-labeled (WkLk, %#+#).

    These predefined edges provide alternatives for any edge extension taking the burden from the user to implement his/her custom edge class - but baring the disadvantage that user edge attributes must be part of a label class as opposed to being part of the edge class directly. It may also serve as a source for looking up how to implement custom edge classes.

    Definition Classes
    collection
  • package generator

    This package helps you to create random graphs with predefined metrics.

    This package helps you to create random graphs with predefined metrics. It is not only possible to create random graph instances but also Scalacheck generators.

    Definition Classes
    collection
  • package generic
    Definition Classes
    collection
  • package immutable
    Definition Classes
    collection
  • package interfaces
    Definition Classes
    collection
  • package mutable
    Definition Classes
    collection
  • Graph
  • GraphBase
  • GraphDegree
  • GraphEdge
  • GraphLike
  • GraphPredef
  • GraphTraversal
  • GraphTraversalImpl
  • State
  • TraverserImpl
t

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
Graph, GraphLike, AdjacencyListBase, AdjacencyListGraph, DefaultGraphImpl, Graph, AdjacencyListGraph, DefaultGraphImpl, Graph, GraphLike
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
  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: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    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)
    Implicit
    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
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  8. 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.

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

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

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

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

  13. 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] to Ensuring[GraphDegree[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: (GraphDegree[N, E]) ⇒ Boolean): GraphDegree[N, E]
    Implicit
    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
  15. def ensuring(cond: Boolean, msg: ⇒ Any): GraphDegree[N, E]
    Implicit
    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
  16. def ensuring(cond: Boolean): GraphDegree[N, E]
    Implicit
    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
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def formatted(fmtstr: String): String
    Implicit
    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()
  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  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
    Annotations
    @native()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  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
    @native() @throws( ... )
  35. def →[B](y: B): (GraphDegree[N, E], B)
    Implicit
    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
  36. object Degree extends (GraphDegree.this)#DegreeFunction
  37. object DegreeOrdering extends Serializable
  38. object InDegree extends (GraphDegree.this)#DegreeFunction
  39. object IntReverseOrdering extends Ordering[Int]

    Decreasing ordering of integers.

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

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