Project created in data structure and algorithm course. Here we've implemented bellmanford's shortest path algo. and dijkstra's shortest path algorithm in java. User will have to enter starting point and destination and shortest path will be displayed on the map with total distance using java swing. Warning: Path display may vary based on your display size.