Consider the map below. You start at point A and wish to reach point B, only going downward at each step. When passing through a vertex, you must pay the toll value associated with it You wish to compute a path from A to B whose total cost is as small as possible. 3 2 The general problem is as follows: you are given a directed acyclic graph with n vertices (named 1, 2,..., n) along with their respective toll costs wi, w2,..., Wn, and a list of m edges Consider the map below. You start at point A and wish to reach point B, only going downward at each step. When passing through a vertex, you must pay the toll value associated with it You wish to compute a path from A to B whose total cost is as small as possible. 3 2 The general problem is as follows: you are given a directed acyclic graph with n vertices (named 1, 2,..., n) along with their respective toll costs wi, w2,..., Wn, and a list of m edges