Process Map Data using C++ Adjacency List Shortest Path
$9.99
ENROLL NOWCourse Overview
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.
Course FAQs
What are the prerequisites for 'Process Map Data using C++ Adjacency List Shortest Path'?
Prerequisites for this continuing education class are set by Coursera Project Network. Most professional development online classes benefit from some prior knowledge. Please check the provider's page for specific requirements.
Will I receive a certificate for this CE class?
Yes, upon successful completion, Coursera Project Network typically offers a shareable certificate to showcase your new skills and fulfill your continuing education requirements.
How long does this online course take to complete?
Completion times for online continuing education courses vary. The provider's website will have the most accurate estimate of the time commitment needed.
