scalation.graphalytics

APShortestPath

class APShortestPath extends AnyRef

The APShortestPath class is used to solve shortest path problems for graphs stored in matrices. It solves the All-Pairs Shortest Path (APSP) problem for directed graphs. The edge cost/distance (must be non-negative) can be stored in either a dense or sparse matrix. The Floyd-Warshall Algorithm is used.

See also

http://math.stackexchange.com/questions/240556/radius-diameter-and-center-of-graph

http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm APSP can be used to determine a graph's eccentricities, radius and diameter. These can also be computed using a BFS-based algorithm.

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

Instance Constructors

  1. new APShortestPath(c: Matrix)

    c

    the cost/distance matrix.

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. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def diam: Double

    Return the diameter (longest shortest path) of the graph.

    Return the diameter (longest shortest path) of the graph. Must call 'spath' first.

  9. def ecc(i: Int): Double

    Return the eccentricity of vertex 'i'.

    Return the eccentricity of vertex 'i'. Must call 'spath' first.

    i

    the vertex whose eccentricity is sought

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

    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  19. def rad: Double

    Return the radius (minimum eccentricity) of the graph.

    Return the radius (minimum eccentricity) of the graph. Must call 'spath' first.

  20. val rang: Range

  21. def spath(): Unit

    Determine the shortest from vertex i to j for all pairs of vertices.

    Determine the shortest from vertex i to j for all pairs of vertices. The matrix 'c' is changed in-place from edge length to least distance.

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

    Definition Classes
    AnyRef
  23. def toString(): String

    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped