shortest paths & geodesics

Question

given a mesh made entirely of quads, where every vertex has valence n (with n >= 3), and does not lie on the same plane, I need to find the distance of every vertex in the m

Answer 1

Another option: Euclidean Shortest Path Algorithm This is a recent (2012) generic implementation of shortest path.