Determine Shortest Paths Between Routers Using Python

4.6
estrellas

16 calificaciones

ofrecido por
En este proyecto guiado, tú:
2 hours
Intermedio
No se necesita descarga
Video de pantalla dividida
Inglés (English)
Solo escritorio

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.

Habilidades que desarrollarás

  • Python Read CSV

  • Python Programming

  • Python Default Dictionary

  • Python Adjacency List

  • Shortest Path Problem

Aprende paso a paso

En un video que se reproduce en una pantalla dividida con tu área de trabajo, tu instructor te guiará en cada paso:

Cómo funcionan los proyectos guiados

Tu espacio de trabajo es un escritorio virtual directamente en tu navegador, no requiere descarga.

En un video de pantalla dividida, tu instructor te guía paso a paso

Preguntas Frecuentes