Process Map Data using C++ Adjacency List Shortest Path

位教师：David Dalsveen

访问权限由 New York State Department of Labor 提供

指导项目

在专家的指导下，学习、练习并应用工作就绪技能

中级等级

推荐体验

2 hours

自行安排学习进度

实践学习

了解更多

指导项目

在专家的指导下，学习、练习并应用工作就绪技能

中级等级

推荐体验

2 hours

自行安排学习进度

实践学习

了解更多

您将学到什么

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.

您将练习的技能

要了解的详细信息

可分享的证书

添加到您的领英档案

授课语言：英语（English）

无需下载或安装

仅桌面可用

了解顶级公司的员工如何掌握热门技能

了解关于 Coursera for Business 的更多信息

Petrobras, TATA, Danone, Capgemini, P&G 和 L'Oreal 的徽标

在 2 小时内学习、练习并应用岗位必备技能

接受行业专家的培训
获得解决实训工作任务的实践经验
使用最新的工具和技术来建立信心

关于此指导项目

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.

分步进行学习

在与您的工作区一起在分屏中播放的视频中，您的授课教师将指导您完成每个步骤：

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.