Package org.drip.sample.shortestpath

Class JohnsonSinglePair

java.lang.Object
org.drip.sample.shortestpath.JohnsonSinglePair
public class JohnsonSinglePair
extends java.lang.Object
JohnsonSinglePair illustrates the Shortest Path Generation for a Directed Graph using the Johnson Algorithm for a given Source Destination Pair. The References are:

  • Black, P. E. (2004): Johnson's Algorithm https://xlinux.nist.gov/dads/HTML/johnsonsAlgorithm.html
  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Johnson, D. B. (1977): Efficient Algorithms for Shortest Paths in Sparse Networks Journal of the ACM 24 (1) 1-13
  • Suurballe, J. W. (1974): Disjoint Paths in a Network Networks 14 (2) 125-145
  • Wikipedia (2019): Johnson's Algorithm https://en.wikipedia.org/wiki/Johnson%27s_algorithm




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    JohnsonSinglePair()  

  • Method Summary

    Modifier and Type Method Description
    static void main​(java.lang.String[] argumentArray)
    Entry Point

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • JohnsonSinglePair

      public JohnsonSinglePair()

  • Method Details

    • main

      public static final void main​(java.lang.String[] argumentArray) throws java.lang.Exception
      Entry Point
      Parameters:
      argumentArray - Command Line Argument Array
      Throws:
      java.lang.Exception - Thrown on Error/Exception Situation