Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
