Process Map Data using C++ Adjacency List Shortest Path

제공자:
Coursera Project Network
학습자는 이 안내 프로젝트에서 다음을 수행하게 됩니다.

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.

Clock2 hours
Intermediate중급
Cloud다운로드 필요 없음
Video분할 화면 동영상
Comment Dots영어
Laptop데스크톱 전용

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.

개발할 기술

  • C++ Algorithms
  • C++ Data Structures
  • C++ Linked List
  • C++
  • Adjacency List

단계별 학습

작업 영역이 있는 분할 화면으로 재생되는 동영상에서 강사는 다음을 단계별로 안내합니다.

  1. Analyze the shortest distance problem and Create the C++ Edge Class.

  2. Create an Adjacency List using a Vector where Each entry is a C++ Linked List.

  3. Add a C++ function to find minimum distance between the source vertex and the other vertices.

  4. Add the C++ function to find the shortest paths to each vertex from the source vertex.

  5. Add the function to populate the adjacency list of edges from a file using a C++ Map container.

안내형 프로젝트 진행 방식

작업 영역은 브라우저에 바로 로드되는 클라우드 데스크톱으로, 다운로드할 필요가 없습니다.

분할 화면 동영상에서 강사가 프로젝트를 단계별로 안내해 줍니다.

자주 묻는 질문

자주 묻는 질문

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.