The algorithm for finding the shortest path in a graph is applied to the brachistochrone problem of classical mechanics, discretized on a spatial lattice. The results are in agreement with those obtained by variational techniques within the error limits introduced by the lattice. The new approach provides more insight and promises to be more flexible than conventional methods.

This content is only available via PDF.
You do not currently have access to this content.