Packages

class SSShortestPath extends AnyRef

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.

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

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SSShortestPath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SSShortestPath(c: MatriD, s: Int)

    c

    the cost/distance matrix, where a value of zero implies no connection. If the actual distance is zero, use a very small number instead.

    s

    the single-source vertex

Type Members

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

    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

Value Members

  1. def spath(): (VectoD, VectorI)

    Determine the shortest path from vertex 's' to each vertex 'j' returning the vector 'd' giving the distance from 's' to all other vertices and the vector 'p' of predecessor vertices.

    Determine the shortest path from vertex 's' to each vertex 'j' returning the vector 'd' giving the distance from 's' to all other vertices and the vector 'p' of predecessor vertices. The path from 's' to each vertex can be deduced from the 'p' vector.