QnA for help information.txt

Help Window QnA

Q: What does this program do?
A: It finds the shortest path between two points.

Q: How do I start the program?
A: Select one start node and one destination node on the map and then press Start.

Q: What is Map 1 showing?
A: Map 1 is taken from Google Maps, and shows the area involved in the algorithm.

Q: What is Map 2 showing?
A: Map 2 is a graphical version of map 1. It simplifies the map to give a better understanding of how the algorithm sees the roads.

Q: What do the buttons on the map represent?
A: The buttons act as nodes, this is what the algorithm works from to find the shortest path.

Q: How do I decide which node to select as my start node?
A: You can base it off of which node you are nearest to. Or just from where you want to start the path from.

Q: What does the Path box show? 
A: When the program has calculated the path, it will show here.

Q: How accurate is the time taken to travel the path?
A: The walk time: Based off of how long it takes to walk 1km
	jog time: Based off of how long it takes to jog 1km
	run time: Based off of how long it takes to run 1km
      drive time: Based off of how long it takes to drive 1km

Q: Why are the nodes changing colour?
A: The first node (the start node) becomes blue, the second one (the destination node) turns red.