Due May 3-d A.Paz
(i) Ignore weights and apply the DFS algorithm. Show the order in which the vertices of the graph are visited.
(ii) Same as (i) but with BFS.
(iii) With weights, find the single source shortest paths from A .
(iv) With weights , find all distances shortests paths.
(v) Find a minimum weight spanning tree for the graph.