- Hanoi Bus Map using undirected graph (weight = 1) and JRB library
- Dijkstra's Algorithm to find shortest path
- Greedy Algorithm to generate bus suggestion from given path
- Find ID of a location
- Find location through an ID
- Check connection between 2 locations
- Adjacent locations
- Shortest path between 2 locations
- Show all buses through a location
- Show all locations of a bus
- Show busmap connections
- Show buses through all locations
- Exit
Simply run ./runmap.sh