1. URL.cpp - This file implements all the normalizing methods on a given
             url.

2. URLTest.h - This file has the cppUnit bootstrapping for testing the 
               normalization process on a set of urls.

3. URLTestsFile.txt - A set of urls used for testing the normalization.

Compilation: g++ URL.cpp -o URLTool -lCppUnit

Execution: ./URLTool

1. Maze.java - This is the maze abstraction class which maintains the walls 
               and all the visited Matrix. This is the Class used by the 
               generation and path finder methods.

2. MazeCanvas.java - This is the main Canvas UI abstraction, this maintains
                     all the UI generation code, frame re-painting for 
                     displaying the maze and the solution path of the maze.

3. MazeGenerator.java - This class is an abstract class with the template
                        method called generate(). Different algorithms for 
                        generating the maze like DFS, RECURSIVE_DIVISION, etc..
                        have to subclass this and override generate().

4. MazeGeneratorDFS.java - A concrete implementation of the DFS Algorithm to
                           generate a maze. Its the subclass of MazeGenerator.

5. MazePathFinder.java - Its a subclass of MazeCanvas, since this application is 
                         a UI app, this class subclasses the MazeCanvas and get the
                         generated maze matrix from the Generator classes.

6. MazeSolver.java - This is the driver class that begins the app, it takes two args
                     for width and height. The width and height should be > 1.

Compilation: checkout the mazesolver folder and do a maven build.
             'mvn clean compile assembly:single'

Execution:   The target maven folder contains a jar 'MazeSolverDemo*-jar-with-dependencies.jar'
             'java -jar MazeSolverDemo*-jar-with-dependencies.jar <width> <height>'

Output: A solid red line between the source and destination dots specifies the final path, whereas
        the grey dotted path specifies the backtracking the algorithm did before reaching the destination.
        See images for sample output.
TODO: Implement different maze generation algorithms like recursive divsion, hunt-and-kill etc..,