Determine Shortest Paths Between Routers Using Python

4.5
10 個評分
提供方
Coursera Project Network
在此指導項目中,您將:

Create an Adjacency List using a Python Dictionary where each entry is a List.

Add the Python 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 Python Dictionary container.

Clock2 hours
Intermediate中級
Cloud無需下載
Video分屏視頻
Comment Dots英語(English)
Laptop僅限桌面

By the end of this project you will use the adjacency list data structure and other data structures to find the shortest distance between a set of routers 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 mapping. Another common application for its use is in computer networking routing to find the shortest trip for a packet. 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.

您要培養的技能

  • Python Read CSV
  • Python Programming
  • Python Default Dictionary
  • Python Adjacency List
  • Shortest Path Problem

分步進行學習

在與您的工作區一起在分屏中播放的視頻中,您的授課教師將指導您完成每個步驟:

  1. Analyze the shortest distance problem and Create the Python Edge Class.

  2. Create an Adjacency List using a Python Dictionary where each entry is a List.

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

  4. Add the Python 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 Python Dictionary container.

指導項目工作原理

您的工作空間就是瀏覽器中的雲桌面,無需下載

在分屏視頻中,您的授課教師會為您提供分步指導

常見問題

常見問題

還有其他問題嗎?請訪問 學生幫助中心