I have undirected graph G(n,m). And each vertex has a value v-i. And what polynomial complexity algorithm can help me to find a path s-t so that maximum value of the nod
