Back to Determine Shortest Paths Between Routers Using Python
Learner Reviews & Feedback for Determine Shortest Paths Between Routers Using Python by Coursera Project Network
17 ratings
About the 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.
Filter by:
1 - 4 of 4 Reviews for Determine Shortest Paths Between Routers Using Python
By Ariel C F
•Sep 30, 2022
This is a great course!
By Sasisrivundavilli
•Nov 1, 2021
good
By 121910309040 N A K
•Aug 16, 2021
Good
By safi c
•Nov 30, 2021
If you need simply project, this is it but you need research to understand. Instructor didnt explained well, he needs to add 1 more video atleast to wrap up.
Coursera Footer
© 2023 Coursera Inc. All rights reserved.
