Package org.drip.sample.connectivity

Class KosarajuSCC

java.lang.Object
org.drip.sample.connectivity.KosarajuSCC
public class KosarajuSCC
extends java.lang.Object
KosarajuSCC illustrates the 2-pass Kosaraju Algorithm for determining Strongly Connected Components. The References are:

  • Aho, A. V., J. E. Hopcroft, and J. D. Ullman (1983): Data Structures and Algorithms Addison Wesley
  • Blelloch, G. E., Y. Gu, J. Shun, and Y. Sun (2016): Parallelism in Randomized Incremental Algorithms Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures 467-478
  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Sharir, M. (1981): A Strong-connectivity Algorithm and its Applications to Data Flow Analysis Computer and Mathematics with Applications 7 (1) 67-72
  • Wikipedia (2020): Kosaraju's Algorithm https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    KosarajuSCC()  

  • 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

    • KosarajuSCC

      public KosarajuSCC()

  • 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