Find the shortest graph distances between every pair of vertices in a given graph. Let us assume that the given graph does not have negative edges. Given a DAG, design a linear time algorithm to...

Find the shortest graph distances between every pair of vertices in a given graph. Let us assume that the given graph does not have negative edges.

Given a DAG, design a linear time algorithm to determine whether there is a path that visits each vertex exactly once.