C/C++ programmin please

Finding the shortest path to go to other buildings from Computer Science building

Acquirement:

Both Greedy and Dynamic programming are basic strategies of algorithm design. In this project, you are asked to implement, and test a greedy algorithm (Dijkstra's Algorithm) and a dynamic programming algorithm (Bellman Ford). Graphs are broadly used in modeling real world applications. You can use the prototype of the abstract data type (ADT) graph developed in previous project and further extend it.

Project Objective:In completing this project, you will further develop your ability to

1. Simplify and solve real world problems;
2. Apply the existing algorithms into real world applications;
3. Design reasonable software solutions;
4. Implement and verify potential solutions;
5. Collaborate with team members.

College Square 200 250 Speech Language Hearing Lewis Science Center 150 100 300 30 Computer Science Burdick 120 80 40 80 Prince Center Torreyson Library 300 30 130 200 Maintenance College 100 Old Main 200 100 150 90 50 180 Police Dept. Fine Art McALister Hall 160 50 BO LOO 100 100 Student Center Wingo 150 100 50 110 50 30 Student Health Center New Business Building Oak Tree Apt. 20 40 200 Brewer-Hege man 350 Bear village Apt