Location:
Search - Dijkstra gui
Search list
Description: 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
Platform: |
Size: 11264 |
Author: |
Hits:
Description: 这是一个java程序，希望大家好好学习哦！-This is a java program, I hope everyone study hard oh!
Platform: |
Size: 745472 |
Author: mengzhihu |
Hits:
Description: 使用VC++编写的城市间最短路径问题的演示程序，具有图形化界面，采用Dijkstra算法，能够生成任意两个城市间的路径长度和具体路径。-This project is programmed in VC++ to demonstrate a demo which solves shortest path problem between two cities。This program has a city network GUI, utilizes Dijkstra algorithm and can produce the length and concrete path between any selected two cities.
Platform: |
Size: 3511296 |
Author: 周博通 |
Hits:
Description: 很好的一本书，适合初学者，尤其对想要用matlab实现与计算机互动的人很重要。-A good book is suitable for beginners, especially to want to use matlab and computer interaction people is very important.
Platform: |
Size: 2013184 |
Author: 王普 |
Hits:
Description: 能够存储和表示给定拓扑结构
2) 能够实现Dijkstra和Bellman-ford算法
3) 根据指定结点，生成路由表并演示算法每一步执行情况
4) 加分项目：GUI界面演示所有信息
-Ability to store and represent a given topology 2) to achieve Dijkstra algorithm and Bellman-ford 3) according to a specified node, the algorithm generates a routing table and demonstrates the implementation of each step 4) extra points: GUI interface demo all the information
Platform: |
Size: 386048 |
Author: 詹春艳 |
Hits:
Description: 改进版的迪杰斯特拉算法，主要用于路径规划，效果良好(Improved version of the Dijkstra algorithm, mainly for path planning, the effect is good)
Platform: |
Size: 12288 |
Author: `sun
|
Hits:
Description: Dijkstra,Floyd，SPFA，Tarjan等算法的Python实现，附有GUI演示。(Dijkstra, Floyd, SPFA, Tarjan, and other Python implementations with GUI demo.)
Platform: |
Size: 132096 |
Author: 幻飘雪
|
Hits:
Description: qt c++ finish that Dijkstra GUI
Platform: |
Size: 581632 |
Author: Wang6751 |
Hits: