Package org.drip.sample.mst

Class ReverseDeleteMaximumForestGenerator

java.lang.Object
org.drip.sample.mst.ReverseDeleteMaximumForestGenerator
public class ReverseDeleteMaximumForestGenerator
extends java.lang.Object
ReverseDeleteMaximumForestGenerator illustrates the Execution of the Reverse-Delete Algorithm for Maximum Spanning Tree. The References are:

  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Kleinberg, J., and E. Tardos (2006): Algorithm Design Addison Wesley
  • Kruskal, J. B. (1956): On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem Proceedings of the American Mathematical Society 7 (1) 48-50
  • Thorup, M. (2000): Near-optimal Fully-dynamic Graph Connectivity Proceedings on the 32nd ACM Symposium on the Theory of Computing 343-350
  • Wikipedia (2019): Reverse-delete Algorithm https://en.wikipedia.org/wiki/Reverse-delete_algorithm




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    ReverseDeleteMaximumForestGenerator()  

  • 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

    • ReverseDeleteMaximumForestGenerator

      public ReverseDeleteMaximumForestGenerator()

  • 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