Package org.drip.sample.shortestpath

Class YenEdgePartitionSinglePair

java.lang.Object
org.drip.sample.shortestpath.YenEdgePartitionSinglePair
public class YenEdgePartitionSinglePair
extends java.lang.Object
YenEdgePartitionSinglePair illustrates the Shortest Path Generation for a Directed Graph using the Bellman-Ford Algorithm for a given Source Destination Pair with the Yen (1970) Edge Partition Scheme applied. The References are:

  • Bang-Jensen, J., and G. Gutin (2008): Digraphs: Theory, Algorithms, and Applications 2nd Edition Springer
  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Kleinberg, J., and E. Tardos (2022): Algorithm Design 2nd Edition Pearson
  • Sedgewick, R. and K. Wayne (2011): Algorithms 4th Edition Addison Wesley
  • Wikipedia (2020): Bellman-Ford Algorithm https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    YenEdgePartitionSinglePair()  

  • 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

    • YenEdgePartitionSinglePair

      public YenEdgePartitionSinglePair()

  • 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