Process Map Data using C++ Adjacency List Shortest Path

Process Map Data using C++ Adjacency List Shortest Path

Instructor: David Dalsveen

What you'll 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.

Details to know

Shareable certificate

Add to your LinkedIn profile

Taught in English

No downloads or installation required

Only available on desktop

See how employees at top companies are mastering in-demand skills

Learn more about Coursera for Business

Learn, practice, and apply job-ready skills in less than 2 hours

Receive training from industry experts
Gain hands-on experience solving real-world job tasks
Build confidence using the latest tools and technologies

About this Guided Project

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.

Learn step-by-step

In a video that plays in a split-screen with your work area, your instructor will walk you through these steps:

Analyze the shortest distance problem and Create the C++ Edge Class.
Create an Adjacency List using a Vector where Each entry is a C++ Linked List.
Add a C++ function to find minimum distance between the source vertex and the other vertices.
Add the C++ function to find the shortest paths to each vertex from the source vertex.
Add the function to populate the adjacency list of edges from a file using a C++ Map container.

Recommended experience

Learners should be familiar with essentials of C++ Classes and Objects, including Constructors, Instance methods, and functions.

3 project images

Instructor

David Dalsveen

Coursera Project Network

24 Courses125,898 learners

Offered by

Coursera Project Network

How you'll learn

Skill-based, hands-on learning
Practice new skills by completing job-related tasks.
Expert guidance
Follow along with pre-recorded videos from experts using a unique side-by-side interface.
No downloads or installation required
Access the tools and resources you need in a pre-configured cloud workspace.
Available only on desktop
This Guided Project is designed for laptops or desktop computers with a reliable Internet connection, not mobile devices.