Dijkstra’s ____ path algorithm finds the shortest path between one node and all other nodes on a ____ graph. It can be used for many purposes where the shortest path between two points needs to be established e.g: GPS ____, IP routing and Telephone networking. We can create a ____ to work through the algorithm. We list the ____. We write that no nodes have been ____ as of yet. We also need to set an initial starting distance for each of the nodes, which is ____. We set the start node as distance from start node = ____. We examine each node ____ to the start node (the lowest distance from the start) and calculate their distance from the start. We mark the start node as visited. Then, we choose the node with the smallest ____ and examine all ____ nodes connected to that node. We only update any distance, where the distance is ____ than that in the table. The process ____ until all the nodes have been visited.

Dijkstra

列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?