scalation.graphalytics

SSShortestPath

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

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SSShortestPath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

    c

    the cost/distance matrix, where aA 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.

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  15. def spath(): (VectorD, 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.

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

    Definition Classes
    AnyRef

  17. def toString(): String

    Definition Classes
    AnyRef → Any

  18. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped