In C++
The Young family has hired you to create their own personal navigation system. Use the area of town. Suggest routes for Mr and Mrs Young, and the Young family according to t HOME Shop 5 2. Traffic Light Diner Mall/ Cinema Park 24 —2- Hospital Offices Bank Library Library -21— LOOC School se Police Station Weights are in miles, assume travel time of 1 minute per mile and 2 minutes of traffic for every intermediate) way point Schedule TIME LOCATION 07:00 07:15 07:30 07:45 16:00 PERSON Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mr. Young Young Family Young Family Young Family Young Family HOME School Shop Offices HOME Hospital Police Station Library School Bank Diner HOME Mall/Cinema Park DESTINATION School Shop Offices HOME Hospital Police Station Library School Diner Bank Diner HOME Mall/Cinema Park HOME Drop off children at School Pickup Supplies Handle Paperwork Drop of supplies Go to work Pick up children’s books Pick up children Wait for rest of family Arrange financials Meet wife, have dinner with family Drop of a vehicle Shop, watch a movie Exercise Go HOME 16:15 16:30 17:30 17:45 21:00 23:00 Requirements: • Use a Graph data structure to store the map in memory • Plan one way and round trips • Use a Class and a Class Member Function . Figure distance as well as time in your calculations • Display all waypoints (including highlighted end points), total distance and time for each leg of a person’s journey • Plan for the shortest routes: i.e. use Dijksta’s algorithm Sample Output . 07:00 – Mrs. Young – [HOME], [School] – 7mi – 11mins . 07:45 – Mrs. Young – Offices], Library. (Hospital) – 4mi- 6mins Show transcribed image text The Young family has hired you to create their own personal navigation system. Use the area of town. Suggest routes for Mr and Mrs Young, and the Young family according to t
HOME Shop 5 2. Traffic Light Diner Mall/ Cinema Park 24 —2- Hospital Offices Bank Library Library -21— LOOC School se Police Station
Weights are in miles, assume travel time of 1 minute per mile and 2 minutes of traffic for every intermediate) way point Schedule TIME LOCATION 07:00 07:15 07:30 07:45 16:00 PERSON Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mrs. Young Mr. Young Mr. Young Young Family Young Family Young Family Young Family HOME School Shop Offices HOME Hospital Police Station Library School Bank Diner HOME Mall/Cinema Park DESTINATION School Shop Offices HOME Hospital Police Station Library School Diner Bank Diner HOME Mall/Cinema Park HOME Drop off children at School Pickup Supplies Handle Paperwork Drop of supplies Go to work Pick up children’s books Pick up children Wait for rest of family Arrange financials Meet wife, have dinner with family Drop of a vehicle Shop, watch a movie Exercise Go HOME 16:15 16:30 17:30 17:45 21:00 23:00 Requirements: • Use a Graph data structure to store the map in memory • Plan one way and round trips • Use a Class and a Class Member Function . Figure distance as well as time in your calculations • Display all waypoints (including highlighted end points), total distance and time for each leg of a person’s journey • Plan for the shortest routes: i.e. use Dijksta’s algorithm Sample Output . 07:00 – Mrs. Young – [HOME], [School] – 7mi – 11mins . 07:45 – Mrs. Young – Offices], Library. (Hospital) – 4mi- 6mins
Expert Answer
Answer to The Young family has hired you to create their own personal navigation system. Use the area of town. Suggest routes for …