1. Created Graph class to represent a directed/undirected, weighted
   graph. A Graph object may be created from an existing Graph object
   with/without transposition, a graph.txt configuration file.

   The inner Edge class is employed to represent a weighted link between
   two vertices.

2. Created DFS class, which conducts a depth first search on a graph.
   It allows implementations of Action interface to provision actions
   upon discovery and completion of exploration of links emitting from
   a discoverd vertice.
3. Created BFS class, which conducts a breadth first search on a graph.
   like DFS class, it also allows provisioning of discovery and explore
   completion actions.

4. junit is utilized to execute unit testing for for algorithms

5. Trivial change in .gitignore to skip .swp files.