Skip to Content

COMP225 : Algorithms and Data Structures

Practical Week 11
Objectives: To understand more about graphs.
  1. (*)

    Submit Program

    Modify your depth first search program from last week so that it displays the depth first spanning tree. To keep it simple we will just display the edges as we traverse through a depth first search of a graph. The data will be input in the same way and the tree will be displayed one edge per line eg 
    (0,1)
(1,2)
(2,3)
etc
    sample run .
  2. Work on assignment 3. You should now be up to implementing Dijkstra's algorithm for single source shortest path.
Remember all Carrano's source code is available on web-site here or on blackboard.