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 SSShortestPath extends AnyRef

    The SSShortestPath class is used to solve shortest path problems for graphs stored in matrices.

    The SSShortestPath class is used to solve shortest path problems for graphs stored in matrices. It solves the Single-Source Shortest Path 'SSSP' problem for directed graphs (both digraphs and multi-digraphs). The SSShortestPath companion object is used to form a matrix from an MGraph. ---------------------------------------------------------------------------- The edge cost/distance (must be non-negative) can be stored in either a dense or sparse matrix. Dijkstra's Algorithm is used.

    Definition Classes
    graph_db
    See also

    en.wikipedia.org/wiki/Dijkstra%27s_algorithm ---------------------------------------------------------------------------- For multi-digraphs, each multi-edge between a pair vertices has it own edge weight (TLabel = VectorD in this case). The minimum is taking when forming the corresponding matrix.

    thescipub.com/PDF/jcssp.2013.377.382.pdf ----------------------------------------------------------------------------

  • Item

case class Item(id: Int, dd: Double) extends Ordered[Item] with Product with Serializable

The Item inner case class has two fields, vertex id and distance from vertex s (the source) as well as a compare method based on distance.

id

the id of the vertex

dd

the vertex's distance from vertex s

Linear Supertypes
Serializable, Serializable, Product, Equals, Ordered[Item], Comparable[Item], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Item
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Ordered
  7. Comparable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Item(id: Int, dd: Double)

    id

    the id of the vertex

    dd

    the vertex's distance from vertex s

Value Members

  1. def <(that: Item): Boolean
    Definition Classes
    Ordered
  2. def <=(that: Item): Boolean
    Definition Classes
    Ordered
  3. def >(that: Item): Boolean
    Definition Classes
    Ordered
  4. def >=(that: Item): Boolean
    Definition Classes
    Ordered
  5. def compare(v: Item): Int
    Definition Classes
    Item → Ordered
  6. def compareTo(that: Item): Int
    Definition Classes
    Ordered → Comparable
  7. val dd: Double
  8. val id: Int