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
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 any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  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. def +(other: String): String

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

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

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

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

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

  9. object DegreeOrdering extends Serializable

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

  11. object IntReverseOrdering extends Ordering[Int]

    Decreasing ordering of integers.

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

  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  14. def clone(): AnyRef

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    AnyRef

  25. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  26. def finalize(): Unit

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

  27. def formatted(fmtstr: String): String

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

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

    Definition Classes
    AnyRef → Any

  29. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  30. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

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

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

    Definition Classes
    AnyRef

  34. final def notify(): Unit

    Definition Classes
    AnyRef

  35. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  37. def toString(): String

    Definition Classes
    AnyRef → Any

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

  39. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

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

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphDegree: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphDegree: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: GraphDegree[N, E]

    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to ArrowAssoc[GraphDegree[N, E]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphDegree: ArrowAssoc[GraphDegree[N, E]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: GraphDegree[N, E]

    Implicit information
    This member is added by an implicit conversion from GraphDegree[N, E] to Ensuring[GraphDegree[N, E]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphDegree: Ensuring[GraphDegree[N, E]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped