Regarding locations

[Lee-Juntong]

We will include 2 types of locations: the specific locations and the bus stops.
Specific locations include LTs, LABs, seminar rooms, hostels, and etc.
Every specific location should be linked to 2 bus stops.
Each specific location needs to know what is the distance between it and another specific location. You may want to use a 2-dimensional array to store the coordinate of the location. You may choose another data structure if you want.
When the distance between 2 specific locations is less than 200 meters, we should suggest the user walk there and say something like "follow the direction on the road/building" (you should determine the exact phrasing). One example is from E3 to E4A, which you can easily find the direction in the building.
The process of finding the route from one specific location to another may be implemented using a hashtable + linked list. Every bus stop will be mapped to several certain values represent the bus lines (since it's not a function, I am not sure whether this should be called a hashtable) in the hashtable (not injective). If the destination and the starting point can be found in the same bus lines, suggest the one with the least stops, and also the alternative. If they are found in different bus lines, suggest how to transit. You may use other implementation as long as it works.
The above summarises the main idea for locations. Please point out mistakes if any.