Determine Shortest Paths Between Routers Using Python

About this course

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.

What you will learn

• 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.