- Computational Thinking
- Program Development
- Algorithms
- Network Routing
- Computer Programming
- Object Oriented Programming (OOP)
- Graph Theory
- Network Routers
- File Systems
- Data Structures
- Computer Networking
- Python Programming
Determine Shortest Paths Between Routers Using Python
Completed by Harshit Yadav
March 9, 2021
2 hours (approximately)
Harshit Yadav's account is verified. Coursera certifies their successful completion of Determine Shortest Paths Between Routers Using Python
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.
Skills you will gain
