Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning.
It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved
Dijkstra algorithm based on a new storage method, which improves the shortcomings of the Dijkstra algorithm to a
certain extent by constructing the map of the forward star by the chain. The experimental results show that our improved
algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application
of actual large graph theory problems.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.