Packages

  • package root
    Definition Classes
    root
  • package scalation
    Definition Classes
    root
  • package graph_db

    The graph_db package contains classes, traits and objects for graph analytics on Trees, 'DAG's and Directed Graphs.

    The graph_db package contains classes, traits and objects for graph analytics on Trees, 'DAG's and Directed Graphs. It provides an implicit conversion when needed for converting doubles to vectors.

    Definition Classes
    scalation
  • class MinSpanningTree extends Error

    The MinSpanningTree class is used to build minimum cost spanning trees from graphs.

    The MinSpanningTree class is used to build minimum cost spanning trees from graphs. Edge cost/weights are given by edge labels. MinSpanningTree implements Prim's algorithm.

    Definition Classes
    graph_db
    See also

    www.cse.ust.hk/~dekai/271/notes/L07/L07.pdf

  • Elem
  • NodeOrder
  • NodeOrder2

object NodeOrder extends Ordering[Elem]

The NodeOrder object defines the order of node indices based on their 'key' value. Using -key to get "smallest first" in priority queue. This is for minimum spanning trees ('min' = true)

Linear Supertypes
Ordering[Elem], PartialOrdering[Elem], Equiv[Elem], Serializable, Serializable, Comparator[Elem], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeOrder
  2. Ordering
  3. PartialOrdering
  4. Equiv
  5. Serializable
  6. Serializable
  7. Comparator
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Ops extends AnyRef
    Definition Classes
    Ordering

Value Members

  1. def compare(e1: Elem, e2: Elem): Int
    Definition Classes
    NodeOrder → Ordering → Comparator
  2. def equiv(x: Elem, y: Elem): Boolean
    Definition Classes
    Ordering → PartialOrdering → Equiv
  3. def gt(x: Elem, y: Elem): Boolean
    Definition Classes
    Ordering → PartialOrdering
  4. def gteq(x: Elem, y: Elem): Boolean
    Definition Classes
    Ordering → PartialOrdering
  5. def lt(x: Elem, y: Elem): Boolean
    Definition Classes
    Ordering → PartialOrdering
  6. def lteq(x: Elem, y: Elem): Boolean
    Definition Classes
    Ordering → PartialOrdering
  7. def max(x: Elem, y: Elem): Elem
    Definition Classes
    Ordering
  8. def min(x: Elem, y: Elem): Elem
    Definition Classes
    Ordering
  9. implicit def mkOrderingOps(lhs: Elem): Ops
    Definition Classes
    Ordering
  10. def on[U](f: (U) ⇒ Elem): Ordering[U]
    Definition Classes
    Ordering
  11. def reverse: Ordering[Elem]
    Definition Classes
    Ordering → PartialOrdering
  12. def reversed(): Comparator[Elem]
    Definition Classes
    Comparator
  13. def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: Elem, _ <: U]): Comparator[Elem]
    Definition Classes
    Comparator
  14. def thenComparing[U](arg0: Function[_ >: Elem, _ <: U], arg1: Comparator[_ >: U]): Comparator[Elem]
    Definition Classes
    Comparator
  15. def thenComparing(arg0: Comparator[_ >: Elem]): Comparator[Elem]
    Definition Classes
    Comparator
  16. def thenComparingDouble(arg0: ToDoubleFunction[_ >: Elem]): Comparator[Elem]
    Definition Classes
    Comparator
  17. def thenComparingInt(arg0: ToIntFunction[_ >: Elem]): Comparator[Elem]
    Definition Classes
    Comparator
  18. def thenComparingLong(arg0: ToLongFunction[_ >: Elem]): Comparator[Elem]
    Definition Classes
    Comparator
  19. def tryCompare(x: Elem, y: Elem): Some[Int]
    Definition Classes
    Ordering → PartialOrdering