Determine Shortest Paths Between Routers Using Python

4.5
stars

15 ratings

Offered By
In this Guided Project, you will:
2 hours
Intermediate
No download needed
Split-screen video
English
Desktop only

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.

Skills you will develop

  • Python Read CSV

  • Python Programming

  • Python Default Dictionary

  • Python Adjacency List

  • Shortest Path Problem

Learn step-by-step

In a video that plays in a split-screen with your work area, your instructor will walk you through these steps:

How Guided Projects work

Your workspace is a cloud desktop right in your browser, no download required

In a split-screen video, your instructor guides you step-by-step

Frequently Asked Questions