The work is to develop a Java program to implement Tarjan's planarity testing algorithm
for graphs.(i.e obtain a planar embedding for the given graph G).The program must be GUI oriented.
Specification
The program should show the graphical visualization of each step of tarjan's algorithm(Use Java applet).
The guidelines for coding style and variable names should be followed.
References
1) Combinatorial Algorithms Narsing Deao, Reingold and Nievengelt
2) A paper on planarity testing algorithm(not the original paper) pdf