Location:
Search - Dijkstra Csharp
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: Dijkstra算法源程序希望大家多多交流。-Dijkstra algorithm source we hope to conduct more exchanges.
Platform: |
Size: 1024 |
Author: 韩冰 |
Hits:
Description: Dijkstra算法求最短路径(C#版) using System
using System.Collections
using System.Text
namespace Greedy
{
class Marx
{
private int[] distance
private int row
private ArrayList ways = new ArrayList()
public Marx(int n,params int[] d)
{
this.row = n
distance = new int[row * row]
for (int i = 0 i < row * row i++)
{
this.distance[i] = d[i]
-Dijkstra algorithm for shortest path (C# Version) using System using System.Collections using System.Text namespace Greedy (class Marx (private int [] distance private int row private ArrayList ways = new ArrayList () public Marx (int n, params int [] d) (this.row = n distance = new int [row* row] for (int i = 0 i
Platform: |
Size: 209920 |
Author: wwf |
Hits:
Description: 此程序是我在作毕业设计时做的在c#环境下，用于dijkstra最短路径算法的实现，程序相当完美，希望能为大家提供便利。-This program is my design to do for graduation in the c# Environment Dijkstra shortest path algorithm for the realization process is perfect, hope to be able to facilitate everyone.
Platform: |
Size: 16384 |
Author: zzbzzb |
Hits:
Description: Dijkstra s algorithm C# Source Code
Platform: |
Size: 3072 |
Author: jcw227 |
Hits:
Description: Some program about dijkstra s algorithm
Platform: |
Size: 57344 |
Author: Matt |
Hits:
Description: 用C#语言编写的用dijkstra算法求两点间的最短路径-Written using C# language requirements using dijkstra algorithm shortest path between two points
Platform: |
Size: 15360 |
Author: 钱程 |
Hits:
Description: 实现了AE最短路径Dijkstra算法实现，希望能提供一些帮助-Dijkstra shortest path to achieve the AE algorithm, and the hope to provide some help
Platform: |
Size: 241664 |
Author: qxfeihappy |
Hits:
Description: 利用C#语言实现最短路径dijkstra算法-use C# to implement dijkstra algorithm
Platform: |
Size: 11264 |
Author: 隋 |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。CSHARP实现算法
-Dijkstra algorithm is a typical shortest path algorithm, used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm can come up with the most short-circuit path of the optimal solution, but because a lot of it traversing the computing node, so the efficiency is low. Dijkstra algorithm is a step-by-step search algorithm, to work to keep up to find the shortest path from m to n for each vertex n. CSHARP realization algorithm
Platform: |
Size: 2048 |
Author: |
Hits:
Description: dijkstra最短路径算法的原理及C#实现 -dijkstra algorithm in C#
Platform: |
Size: 27648 |
Author: 臧熹 |
Hits:
Description: Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF -Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF Dijkstra CSharp SPF
Platform: |
Size: 26624 |
Author: kolos450 |
Hits:
Description: 弗洛伊德(Floyd)算法 主要是用于计算图中所有顶点对之间的最短距离长度的算法，如果是要求某一个特定点到图中所有顶点之间的最短距离可以用Dijkstra(迪杰斯特拉)算法来求。
弗洛伊德(Floyd)算法的算法过程是：
1、从任意一条单边路径开始。所有两点之间的距离是边的权，如果两点之间没有边相连，则权为无穷大。
2、对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比已知的路径更短。如果是更新它。
把图用邻接矩阵G表示出来，如果从Vi到Vj有路可达，则G[i,j]=d，d表示该路的长度；否则G[i,j]=无穷大。定义一个矩阵D用来记录所插入点的信息，D[i,j]表示从Vi到Vj需要经过的点，初始化D[i,j]=j。把各个顶点插入图中，比较插点后的距离与原来的距离，G[i,j] = min( G[i,j], G[i,k]+G[k,j] )，如果G[i,j]的值变小，则D[i,j]=k。在G中包含有两点之间最短道路的信息，而在D中则包含了最短路径的信息。
比如，要寻找从V5到V1的路径。根据D，假如D(5,1)=3则说明从V5到V1经过V3，路径为{V5,V3,V1}，如果D(5,3)=3，说明V5与V3直接相连，如果D(3,1)=1，说明V3与V1直接相连。 -Floyd (Floyd) algorithm is mainly used to calculate the length of the shortest distance between the drawing algorithm between all pairs of vertices, if the requirements of a specific point to the diagram all the shortest distance between vertices can Dijkstra (Dinger Stella) algorithm to find.
Floyd algorithm process (Floyd) algorithm is:
1, starting any one-sided way. The distance between two points is all right edge, if there is no edge connected between two points, the right to infinity.
2. For every pair of vertices u and v, and see if there is a vertex w such that w u to v and then shorter than the known path. If you are updating it.
Figure that out of the adjacency matrix G, if there is a road up Vi to Vj, then G [i, j] = d, d represents the length of the path otherwise G [i, j] = infinity. Define a matrix D used to record the information of the inserted point, D [i, j] represents Vi to Vj need to go through the points, initialize D [i, j] = j. The inset in e
Platform: |
Size: 2048 |
Author: 焦慧明 |
Hits:
Description: 一个使用了Dijkstra算法的C#小程序，能计算6个点到各位置的最短路径。(A C# applet using Dijkstra algorithm can calculate the shortest path from 6 points to each location.)
Platform: |
Size: 367616 |
Author: 码农哆啦 |
Hits: