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

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

一个小而有用的专用工具，容许客户寻找2个顶点中间的最短路径的Dijkstra最短路径优化算法开发设计。

全部您必须做的是在左窗格中制作的图型，并应用“净重”和“重 - ”来降低或降低一个边沿的净重。

下面的2个顶点上点击点击“逐渐/完毕”按键时，将你要寻找途径的开始和结束。表明深蓝色，翠绿色顶点开始和结束在红色的顶点的最短路径。

软件简介

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.