Location:
Search - shortest path C
Search list
Description: 用c++实现的单原点最短路径-used to achieve a single source shortest path
Platform: |
Size: 1751 |
Author: 关文 |
Hits:
Description: 关于最短路径的算法，c语言写的-on the shortest path algorithms, written in C language
Platform: |
Size: 2048 |
Author: 陈镇 |
Hits:
Description: Dijistra最短路径 二维数组结构 c-Dijistra Shortest Path 2D array structure c
Platform: |
Size: 1024 |
Author: 阿宝 |
Hits:
Description: 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
Platform: |
Size: 1024 |
Author: 刘兰英 |
Hits:
Description: C#实现的最短路径AStar算法,是我见过最好的AStar算法。-c# shortest path AStar calculation, It is the best calculation I ve ever seen
Platform: |
Size: 65536 |
Author: 杨波 |
Hits:
Description: 数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.
Platform: |
Size: 251904 |
Author: 陈钊 |
Hits:
Description: C语言实现的校园导游图,有景点的介召,最短路径的查找,还有动画等-C language map of the campus tour guides, attractions mediated response, the search for the shortest path, animation, etc.
Platform: |
Size: 191488 |
Author: 林巳钧 |
Hits:
Description: 五个c源代码
矩阵的运算方法
邻接矩阵求解最短路径
全屏幕模拟时钟
先序遍历非递归算法
字符串查找-5 c source code matrix arithmetic method adjacency matrix for the Shortest Path full-screen analog clock preorder non- recursive algorithm to search string
Platform: |
Size: 5120 |
Author: 张广旭 |
Hits:
Description: 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
Platform: |
Size: 38912 |
Author: |
Hits:
Description: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Platform: |
Size: 3072 |
Author: 光光 |
Hits:
Description: 寻最短路径(C# 版)
寻最短路径(C# 版)-find the shortest path (C# version) find the shortest path (C# version)
Platform: |
Size: 37888 |
Author: 飘零 |
Hits:
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: 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algorithm, The algorithm can be used to solve signal processing some of the problems. Bellman_ford.c to source; distance.txt document repository all the distance between points, to 99,999 infinite said. bellman_ford.txt document output files, storage cycle round the middle value, and, finally, the various nodes of the shortest distance, if the plan contains negative loop, the paper returns FALSE.
Platform: |
Size: 103424 |
Author: 李文 |
Hits:
Description: 用Visual C++编写的一个基于文本文件的最短路径程序源码-prepared text of a document based on the shortest path procedures FOSS
Platform: |
Size: 1640448 |
Author: 王亚文 |
Hits:
Description: A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。
公式表示为： f(n)=g(n)+h(n),
其中f(n) 是节点n从初始点到目标点的估价函数，
g(n) 是在状态空间中从初始节点到n节点的实际代价，
h(n)是从n到目标节点最佳路径的估计代价。
-A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
Platform: |
Size: 13312 |
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: 对于无向图或有向图，程序可以计算出图中每两个顶点之间的最短路径，并列出Floyd算法的具体实现-For undirected graph or directed graph, the program can calculate a figure between every two vertices of the shortest path, and lists the specific realize Floyd algorithm
Platform: |
Size: 192512 |
Author: 王海涛 |
Hits:
Description: Floyd最短路径算法的MATLAB程序，经过测试-Floyd shortest path algorithm of MATLAB procedures tested
Platform: |
Size: 1024 |
Author: zuotian |
Hits:
Description: ArcGIS Engine中最短路径，C封装的，在VB.net中调用.rar-ArcGIS Engine in the shortest path, C package, in VB.net call. Rar
Platform: |
Size: 236544 |
Author: 吕子奇 |
Hits:
Description: Dijkstra的算法的c++小程序演示解决的最短路径的问题,希望对大家有用-Dijkstra' s Algorithm in c++ small program demonstrates the shortest path to solve the problem, we want to be useful
Platform: |
Size: 533504 |
Author: 王鹏 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
28
»