TUTORIAL – 7
Data Structures and Algorithms (Date 31/10/2013)
1. Root of a DAG is a vertex r such that every vertex of r can be reached by a directed path
from r. Write an algorithm to determine whether DAG is rooted. Find out its time
complexity.
2. For a given graph (which will be given during the tutorial session)
a.
Find the shortest path distance from vertex a to every other vertices, using
Dijakstra algorithm
b. Using Floyd's algorithm, find out shortest path distance between any pair of
of nodes.
You need to show the execution of various steps in the algorithm (instead of just showing
the final step).