Question: C++ Assignment: Make a program that can compute the shortest distance between two selected points on a graph. Your previous program which can multiply matrices,

C++ Assignment: Make a program that can compute the shortest distance between two selected points on a graph. Your previous program which can multiply matrices, and your knowledge of adjacency matrices should let you do this. There are FIVE DIFFERENT graphs provided with this assignment (see attached document), and for each of the five graphs, you have to find the shortest distance between the points given below. PLEASE NOTE: As some graphs have one-way paths, youll realize the distance from A to B will not always be the same as the distance from B to A.

You do NOT need to tell me WHAT- the path is (dont say A to R to G to F to B). For this assignment we only want the distance. Distance is considered the number of paths you have to cross to get from one point to another. So your results could say 3 steps is the shortest distance or 15 steps or so on.

FOR YOUR ASSIGNMENT: For each of the five graphs, find the shortest distances between the following points.

(1) A to B

(2) B to A

(3) A to C

(4) B to C

(5) C to D

C++ Assignment: Make a program that can compute the shortest distance between

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!