Contains two netbeans projects:
##bfs This project implements bfs and dfs search algorithms on a graph. Currently taking as an input the map of ancient Rome. The program takes command line arguments for the search technique, source and destination.
##USA This project implements astar, greedy and uniform search techniques on a graph. Currently taking as input the map of cities of USA for a fiber network. The program takes command line arguments for the search technique, source and the destination.