Location:
Search - floyed
Search list
Description: 一 题目
全国铁路交通咨询系统
二 需求分析
1.系统配制：
硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备
软件：操作系统Windows xp 源程序调试工具VC6.0
可执行文件运行工具 DOS 5.0.
2.该系统有供用户选择的菜单和交互性。
3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。
三 设计概要
1.抽象数据类型
本程序运用了关于图这种数据结构。
他的抽象数据类型定义如下：
typedef struct unDiGraph
{
int numVerts //结点
costAdj cost //邻接矩阵
}unDiGraph,*UNG
基本操作：
unDiGraph* CreateCostG()
操作结果：构造带权(费用)图。
unDiGraph* CreateTimeG()
操作结果：构造带权（时间）图。
PathMat *Floyed(unDiGraph *D)
操作结果：Floyed函数 求任意两点的最短路径。
-a subject of the national railway traffic advisory system analysis of a two needs. Preparation System : Hardware : CPU : P4 1.6 GHz 256 MB of memory standard input and output device software : Windows XP operating system source code debugging tools VC6.0 executable file running DOS 5 tools. 0. 2. The system is available for users to choose the menu and interactive. 3. The establishment of a national rail traffic advisory system, the system automatically search with arbitrary two inter-city rail traffic and the shortest path to the function at the lowest cost. Three design an outline. This abstract data type procedures on the use of this data structure map. His abstract data type is defined as follows : typedef struct (int unDiGraph numVerts / / node costAdj cost / / adjacency matrix) unDiG
Platform: |
Size: 56930 |
Author: gang |
Hits:
Description: 佛洛依德算法的matlab实现，可求任意两点间的最短距离
Platform: |
Size: 65816 |
Author: 谭春海 |
Hits:
Description: 一 题目
全国铁路交通咨询系统
二 需求分析
1.系统配制：
硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备
软件：操作系统Windows xp 源程序调试工具VC6.0
可执行文件运行工具 DOS 5.0.
2.该系统有供用户选择的菜单和交互性。
3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。
三 设计概要
1.抽象数据类型
本程序运用了关于图这种数据结构。
他的抽象数据类型定义如下：
typedef struct unDiGraph
{
int numVerts //结点
costAdj cost //邻接矩阵
}unDiGraph,*UNG
基本操作：
unDiGraph* CreateCostG()
操作结果：构造带权(费用)图。
unDiGraph* CreateTimeG()
操作结果：构造带权（时间）图。
PathMat *Floyed(unDiGraph *D)
操作结果：Floyed函数 求任意两点的最短路径。
-a subject of the national railway traffic advisory system analysis of a two needs. Preparation System : Hardware : CPU : P4 1.6 GHz 256 MB of memory standard input and output device software : Windows XP operating system source code debugging tools VC6.0 executable file running DOS 5 tools. 0. 2. The system is available for users to choose the menu and interactive. 3. The establishment of a national rail traffic advisory system, the system automatically search with arbitrary two inter-city rail traffic and the shortest path to the function at the lowest cost. Three design an outline. This abstract data type procedures on the use of this data structure map. His abstract data type is defined as follows : typedef struct (int unDiGraph numVerts// node costAdj cost// adjacency matrix) unDiG
Platform: |
Size: 56320 |
Author: gang |
Hits:
Description: 佛洛依德算法的matlab实现，可求任意两点间的最短距离-Freud algorithm matlab realize, arbitrary rectifiable the shortest distance between two points
Platform: |
Size: 65536 |
Author: 谭春海 |
Hits:
Description: Floyed求全局单源最短路径算法，用C++语言实现。-Floyed for the overall single-source shortest path algorithm, using C++ Language.
Platform: |
Size: 198656 |
Author: chenzhiliang |
Hits:
Description: 自己写的公交车站查询系统，基础是光搜以及floyed策略，可以用来学习-Writing the bus station its own inquiry system, basic light search and are floyed strategy can be used to study. .
Platform: |
Size: 4096 |
Author: rf |
Hits:
Description: a) 使用Dijkstra算法和Floyed算法.
b) 对Dijkstra算法使用二叉堆[尝试Fibonacci Heap,发现效率不佳].
c) 对Dijkstra算法进行改进,堆中只保存目前可达的未标记节点,减少堆的大小从而提高堆操作效率.-fsdgjlkfghjhkl给句话、好几个和家干好、fgghjf
Platform: |
Size: 343040 |
Author: zjy |
Hits:
Description: 图论中用得最多的最短路算法即Dijkstra，与Floyed算法。-Graph Theory with most that is the most short-circuit algorithm Dijkstra, and Floyed algorithm.
Platform: |
Size: 1024 |
Author: michael wang |
Hits:
Description: 图论通用各种算法，有大量实例，包括BFS,DFS,Prim, kruskal,Dijkstra,Floyed,Aoe,Aov,topsort-General algorithms of graph theory, a large number of cases, including the BFS, DFS, Prim, kruskal, Dijkstra, Floyed, Aoe, Aov, topsort
Platform: |
Size: 1036288 |
Author: 张前东 |
Hits:
Description: Floyed Impiliment with Write tu File
Platform: |
Size: 63488 |
Author: Ali |
Hits:
Description: 用floyed算法实现求最短路径，可以求出每个点到其他点的最短距离-With floyed the shortest path algorithm
Platform: |
Size: 172032 |
Author: 申孟杰 |
Hits:
Description: kruskal code for computing the min spanning tree
floyed to compute shotrtest path
Platform: |
Size: 1024 |
Author: bassam mohammed |
Hits:
Description: 这个是cpp的Floyed算法，使用c语言编写的-This is the cpp of Floyed algorithm, written using the c
Platform: |
Size: 10240 |
Author: amy |
Hits:
Description: 在VC6.0上通过的弗罗伊德算法，TXT中附有输入数据范例-In VC6.0 algorithm adopted by Freud, TXT in the input data with examples
Platform: |
Size: 60416 |
Author: 宋泽辉 |
Hits:
Description: 包含了floyed算法、a*算法、双端堆、贪吃蛇的实现。都是很好的算法。-Contains floyed algorithm, a* algorithm, double-ended heap, Snake implementation. Are good algorithms.
Platform: |
Size: 120832 |
Author: 范敏 |
Hits:
Description: 最短路径问题的floyed实现，有需要的看看，可以借鉴借鉴-Shortest path problem floyed realize there is a need to look at
Platform: |
Size: 541696 |
Author: 许靖 |
Hits:
Description: 改代码实现了Floyd和Dijkstra算法在最短路径问题上的应用，并且比较了两者的效率。-The code has applied Floyd and Dijkstra algorithm in the shortest path problem, and given the efficiency of the these two algorithms.
Platform: |
Size: 3072 |
Author: liu peng |
Hits:
Description: 根据Floyed算法写出程序计算对顶点间的最短路径和最短距离。-According to the Floyed algorithm to write program to calculate the shortest path and shortest distance between vertices.
Platform: |
Size: 1024 |
Author: Reggie |
Hits:
Description: 算法设计与分析课程中常用的一些算法，包括Floyed算法，Huffman算法、prim算法，单源最短路径算法，分数背包问题-Algorithm Design and Analysis course some commonly used algorithms, including Floyed algorithm, Huffman algorithm, prim algorithm, single-source shortest path algorithm, fractional knapsack problem
Platform: |
Size: 540672 |
Author: liyuqin |
Hits:
Description: 地点测量距离程序总体设计
在TC3.0环境下编译通过，共有5个函数。
分别是Introduce，shortestdistance，floyed，display及main。
其功能分别是：
Introduce：地点介绍函数。
Shortestdistance：计算两地的最短距离。
Floyed：floyed算法求两地的最短距离。
Display：打印两个地点的路径及最短距离至屏幕。
Main：总体控制各函数并提供原始数据。-map distance floyed
Platform: |
Size: 19456 |
Author: 段誉 |
Hits: