Subway Problem N stations in a Undirected Graph - IT/Computer Science Assignment Help

Assignment Task:

Task:

Subway problem

• N stations (0..N-1) in a undirected graph
• B[N][N] : adjacent matrix
• B[i][j] : distance from station-i to station-j (in Km)
• A[N]: avg waiting time in each station
• A[] is filled randomly and updated regurarly (on some time intervals) with new values
• Trains speed = 50 km/h = constant
• hint: we have to create an other "cost" array,
• where the cost from station-i to station-j will be (waiting_time[i] + time[i][j]),
• where time[i][j] = B[i][j]/v, v=50
• Use Dijkstra Algorithm
• input: source station - destination station
• output: find shortest route from source to destination,
• considering also the waiting times (of course).
• important: print the path
• Run the program with various values of N
• i.e. with some example graphs from smaller to bigger,
• e.g. 50 nodes, 100 nodes, 200 nodeswill be ok.

Thanks in advance
Jim
Ps: we can use code from the internet, slightly changed, but with reference where we find it.

The above  IT Assignment has been solved by our  IT Assignment  Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.