兩點(diǎn)間最短路徑算法(Dijkstras Shortest Path Algorithm)

兩點(diǎn)間最短路徑算法(Dijkstra's Shortest Path Algorithm)

一個(gè)小而有用的工具，允許用戶找到兩個(gè)頂點(diǎn)之間的最短路徑的Dijkstra最短路徑算法開發(fā)。

所有您需要做的是在左窗格中繪制的圖形，并使用“重量”和“重 - ”來增加或減少一個(gè)邊緣的重量。

接下來的兩個(gè)頂點(diǎn)上單擊單擊“開始/結(jié)束”按鈕時(shí)，將你想找到路徑的開始和結(jié)束。顯示藍(lán)色，綠色頂點(diǎn)開始和結(jié)束在紅色的頂點(diǎn)的最短路徑。

原文介紹

Dijkstra's Shortest Path Algorithm was developed as a small and useful tool that allows the users to find the shortest path between two vertices.

All you have to do is draw a graph in the left pane and use the "weight +" and "weight -" to increase or decrease the weight of an edge.

When the "Start/End" button is clicked the next two vertices you click on will be the start and end of the path you want to find.

The shortest path is displayed in blue with the start vertex in green and the end vertex in red.