Windows应用程序，C#编写，实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点（该点是一个可以点击的按钮），这些按钮按照出现的先后顺序自动从1开始编号（目前程序设定最多支持100个点，可自行更改）。界面右上角是计算结果显示区，往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区，状态区显示当前的起点和终点，连线和计算都要用到该信息（点击生成的顺序编号的那些按钮可以依次改变起点和终点）。输入权值后点“连线”则把编号为状态区显示的起点和终点连接起来，并在线的中央标明权值。点击“计算”则计算状态区显示的起点和终点的最短距离及路径，并将结果输出到右上角。右下角为异常显示区，显示程序运行过程中出现的异常，比如权值输入一个字母，因字母无法转为整型，就会产生异常，该异常信息就显示在右下角。-Windows applications, C#, for the realization of the Dijkstra shortest path algorithm, convenient operation, the procedure can own interface on a point each designated location, gaps at the interface of each click generated a point (the point is a can click on the button), these buttons with the automatic sequence starting from No. 1 (the current procedure set up to support 100 points can make changes). Instructions interface is calculated results show, right down the value of the importation and the "Alliance" "screen" "calculated" button and the three state area, the current state of the district show the starting and finishing points. Alliance and calculation should use the information (click generation of serial numbers of those buttons can be followed to