Given a graph of edges and vertexes, is there an easy/existing method to compute the shortest path (or propagate, e.g. dijkstra) in Esenthel?

Any recommendations?

Thanks,
Chris

There is no builtin function for that