Chevron Left
Volver a Determine Shortest Paths Between Routers Using Python

Opiniones y comentarios de aprendices correspondientes a Determine Shortest Paths Between Routers Using Python por parte de Coursera Project Network

4.6
estrellas
16 calificaciones

Acerca del Curso

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....
Filtrar por:

1 - 4 de 4 revisiones para Determine Shortest Paths Between Routers Using Python

por Ariel C A F

30 de sep. de 2022

por Sasisrivundavilli

1 de nov. de 2021

por 121910309040 N A K

16 de ago. de 2021

por safi c

30 de nov. de 2021