- Level Intermediate
- Duration 3 hours
- Course by Coursera Project Network
-
Offered by
About
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.Modules
Determine Shortest Paths Between Routers Using Python
1
Assignment
- Graded Quiz: Test your Project understanding
1
Discussions
- Adjacency List
1
Labs
- Determining Shortest Paths Between Routers Using Python
1
Readings
- Project-based Course Overview
Auto Summary
This professional-level course focuses on determining the shortest paths between routers using Python, ideal for those in IT & Computer Science. Led by Coursera, it teaches you to use adjacency lists and other data structures to efficiently map and route networks. The course spans 120 minutes and is best suited for learners in North America, with a Starter subscription option available. Perfect for professionals looking to enhance their networking and mapping skills.

Instructor
David Dalsveen