In this project you will use the adjacency list data structure and other data structures to find the shortest distance between a set of towns loaded from a file.
In this project you will use the adjacency list data structure and other data structures to find the shortest distance between a set of towns loaded from a file.
The shortest path problem is well known in the field of computer science. An adjacency list is probably the best data structure to represent a set of connected vertices to find the shortest path from one vertex to another. One application for shortest paths is in computer networking routing. Another common application for its use is on a Map, where it is useful to find the shortest distance from one town to another.
Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.