Scribd
Upload
2 views

Shortest-path

Uploaded by

nguyenduydang225
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Shortest-path

Uploaded by

nguyenduydang225
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Problem 1 (5 points)

Given the following graph:

G1 (start at vertex 1)

G2 (start at vertex A)

G3 (start at vertex a)

G4 (start at vertex A)
G5 (start at vertex A)

a. Apply three methods, Dijkstra, Bell-man Ford, and Floyd-Warshal, to find the shortest path starting from
the corresponding vertex to all the others. Present the solution in the report (following the guidance in slide
– Chapter 10 connectivity). If any method cannot be used, please provide the reason.
b. Implement the above solution in C++ and capture the result, including total cost, path, and time-consuming
(show it on the report) and submit source code later (we can use any kind of matrix to re-present the graph).

Problem 2 (5 points)

As you can see in Google Maps apps, whenever we find our way, they give us some options besides the shortest
path. That is a problem with exciting applications. In this article, we want you to find a solution to the kth short
path problem. We target three main subproblems:
a. Research the approach for k-th shortest path problem, present whatever you understand, and how we can
execute it (as much detail as possible). Please use at least one example to explain your approach.
b. Get the data from Google Maps or any Map you can find (such as Here map or Apple Map) and re-present it as
an adjacency matrix. The matrix size should not be less than 50 vertices and 50 edges. In your data, there should
be including two majority locations: HCMUT and Ben Thanh market)

c. Implement your method to find at least three of the shortest paths from HCMUT to the Ben Thanh market.
Compared with Google Maps (total cost), Please give some analysis
Requirements
1. Form a group of up to 5 people and at least 4. Please choose your team and fill in the link (the leader of
each should be noted) - The deadline is August 15th:
https://docs.google.com/spreadsheets/d/1dFMX21ZFwS7LF9lntf13f--
Vfse0SVIvLmPb7YUy854/edit?usp=sharing
2. Remember that what we learned is much better than the score. I will give you the corresponding score
based on your effort and how I understand it.

4. The effort percentage of each member contributing to this work should be noted in the report; otherwise, all
members will get similar points.

5. All acts of copying and exchanging reports are strictly prohibited. I will check your source code and report
carefully.

6. Submit all collected documents, including source code, report, data, etc. (in a single zip file). Only the
leader submits it.

7. The deadline for this Assignment is August 30th at 11h59 pm (submit to BKEL) – no extension.

https://lms.hcmut.edu.vn/mod/workshop/view.php?id=294808

You might also like