We are given a graph G with vertex set V(G) and edge set E(G). Every edge e has a weight we. Write an LP whose optimal solution is equal to the length of the shortest path from a vertex s to a vertex t in this graph. You may write some constraints over the edge set or vertex set of the graph. For instance, you can write V(u,v) = E(G) In the above example, fi's are the variables of your LP. Wufu+ wf, 10.