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.

ガイド付きプロジェクトの仕組み

ワークスペースは、ブラウザに完全にロードされたクラウドデスクトップですので、ダウンロードは不要です

分割画面のビデオで、講師が手順ごとにガイドします

よくある質問

よくある質問

さらに質問がある場合は、受講者ヘルプセンターにアクセスしてください。