(Solved) : 50 Pts Given Directed Graph G N Vertices M Edges M N Vertex V Height H V Cost Traversing Q37297508 . . .
A. (50 PTS.) We are given a directed graph G with n vertices and m edges (m 〉 n), where each vertex v has a height h(v). The cost of traversing an edge (u, v) is c(u, v) – Ih(v)…