Class JohnsonPathGenerator<V>

java.lang.Object
org.drip.graph.shortestpath.OptimalPathGenerator
org.drip.graph.bellmanford.JohnsonPathGenerator<V>

public class JohnsonPathGenerator<V>
extends OptimalPathGenerator
JohnsonPathGenerator generates the Shortest Path for a Directed Graph using the Johnson Algorithm. 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 Details

    • JohnsonPathGenerator

      public JohnsonPathGenerator​(Directed<?> graph, boolean shortestPath, FHeuristic fHeuristic) throws java.lang.Exception
      JohnsonPathGenerator Constructor
      Parameters:
      graph - Graph underlying the Path Generator
      shortestPath - TRUE - Shortest Path Sought
      fHeuristic - F Heuristic
      Throws:
      java.lang.Exception - Thrown if the Inputs are Invalid
  • Method Details

    • augmentVertexes

      public VertexAugmentor augmentVertexes​(java.lang.String sourceVertexName)
      Description copied from class: OptimalPathGenerator
      Generate the Augmented Vertex Suite starting from the Source Vertex
      Specified by:
      augmentVertexes in class OptimalPathGenerator
      Parameters:
      sourceVertexName - The Source Vertex Name
      Returns:
      The Augmented Vertex Suite