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.

指导项目工作原理

您的工作空间就是浏览器中的云桌面,无需下载

在分屏视频中,您的授课教师会为您提供分步指导

常见问题

常见问题

还有其他问题吗?请访问 学生帮助中心