Process Map Data using C++ Adjacency List Shortest Path
By External Provider
About this course
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.
What you will learn
- Create an Adjacency List using a Vector where Each entry is a C++ Linked List.
- Add a C++ function to find the shortest paths to each vertex from the source vertex.
- Add the a C++ function to populate the adjacency list of edges from a file.