courseraАнализ данных

Determine Shortest Paths Between Routers Using Python

Курс от Coursera

Средний≈ 2.1 чАнглийский

О курсе

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.

Навыки, которые вы освоите

Algorithms Graph Theory Data Structures Python Programming File I/O Computer Networking Computer Programming Network Routing Program Development Object Oriented Programming (OOP)Network Routers

Программа курса

1 модулей · 5 учебных материалов

01Determine Shortest Paths Between Routers Using Python5 материалов

Determine Shortest Paths Between Routers Using Python

Project-based Course OverviewЧтение Determining Shortest Paths Between Routers Using PythonЛабораторная Graded Quiz: Test your Project understandingЗадание

Учитесь у экспертов

David Dalsveen

Subject Matter Expert