Determine Shortest Paths Between Routers Using Python に戻る
Coursera Project Network による Determine Shortest Paths Between Routers Using Python の受講者のレビューおよびフィードバック
10件の評価
コースについて
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.
フィルター：
Determine Shortest Paths Between Routers Using Python： 1 - 3 / 3 レビュー
by Sasisrivundavilli
•2021年11月1日
good
by 121910309040 N A K
•2021年8月16日
Good
by safi c
•2021年11月30日
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
©2021 Coursera Inc.All rights reserved.
