两点间最短路径算法(Dijkstras Shortest Path Algorithm)

两点间最短路径算法(Dijkstra's Shortest Path Algorithm)

一个小而有用的工具，允许用户找到两个顶点之间的最短路径的Dijkstra最短路径算法开发。

所有您需要做的是在左窗格中绘制的图形，并使用“重量”和“重 - ”来增加或减少一个边缘的重量。

接下来的两个顶点上单击单击“开始/结束”按钮时，将你想找到路径的开始和结束。显示蓝色，绿色顶点开始和结束在红色的顶点的最短路径。

原文介绍

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.