什么是最短通路问题？ In a shortest-paths problem,we are given a weighted,directed graph G=(V,E),with weight function w:ER mapping edges to real-valued weights.The weight w(p)of path p=(vo,v1,...,v)is the sum of the weights of its constituent edges: 问题： k w(p)=∑w(-4,). 偷入是什么？喻 i=1 :是什么？ We define the shortest-path weight &(u,v)from u to v by 8u,)= minw(p):uv if there is a path from u tov, 00 otherwise A shortest path from vertex u to vertex v is then defined as any path p with weight w(p)=6u,v).什么是最短通路问题?