help2200

It's UWAweek 48

help2200

This forum is provided to promote discussion amongst students enrolled in CITS2200 Data Structures and Algorithms.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!" followup message.

How do I ask a good question?

Displaying the 3 articles in this topic

Showing 3 of 176 articles.
Currently 8 other people reading this forum.

UWA week 21 (1st semester, week 12) ↓

Lab 6 Path (all 3)

3:23pm Tue 21st May, ANONYMOUS

For lab 6 test case, it would be helpful if anyone has already solved the path from 0 to 1 with time 39 to post the route being taken.

Lab 6 Path (all 3)

11:22am Wed 22nd May, ANONYMOUS

This is the path for the sample 0-6-0-3-4-7-4-3-0-6-8-0-3-4-1 4+4+1+4+2+2+4+4+4+1+1+1+4+3 = 39

Lab 6 Path (all 3)

12:47pm Wed 22nd May, ANONYMOUS

Does anyone else have the same problem? My code returns: 0-6-0-3-4-7-4-3-0-5-8-0-3-4-1, instead of 0-6-0-3-4-7-4-3-0-6-8-0-3-4-1. But this is because Dijkstra's algorithm would pick the smaller edge, 0-5 instead of 0-6. However, 0-6-8 results in a total distance shorter than 0-5-8 even though the initial edge weight from 0 is higher.

help2200 articles all ANNOUNCEMENTS recent articles login to post a new article help2200 topics from today and yesterday from the past week from the past two weeks ALL topics, most recent first	login chapter0 unitinfo research projects csforum csse-feedback csbreakdown cssubmit csmarks 2nd semester help fora Algebra Advanced Algorithms Cloud Computing High Performance Computing Intelligent Agents Professional Computing Relational Database Management Systems Systems Programming