Given a directed acyclic graph G = (V,E) and two distinguished vertices s and t. Both the edges and vertices are assigned real-valued weights. The weight of a path is defined as the sum of all the edges and vertices on the path. The problem is to find a shortest weighted simple path from s to t.
(a) Design a dynamic programming algorithm and briefly describe it.
(b) Design a greedy algorithm and briefly describe it.
(c) Provide upper and lower bounds of one of your algorithms as tight as possible.
How do I do this? Can Dijkstra be used?
