Search - search shortest path

Search - search shortest path - List

[Windows Develop] 全国交通咨询系统 DL : 0: 一　题目全国铁路交通咨询系统二　需求分析 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
Date : 2008-10-13 Size : 55.6kb User : gang
[Windows Develop] 全国交通咨询系统 DL : 0: 一　题目全国铁路交通咨询系统二　需求分析 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
Date : 2026-01-10 Size : 55kb User : gang
[Windows Develop] Lgraph-2 DL : 0: C++编码，最短路径，广度搜索，深度搜索等图相关函数实现-C++ Encoding, shortest path, breadth of search, the depth of search, such as map-related function
Date : 2026-01-10 Size : 356kb User : taufik
[Windows Develop] migong_2 DL : 0: 开发环境visual studio 2005 实现的是一个小的可以在图片上点击实现搜索最短路径的迷宫类的东西。所有源码都在。-Visual studio 2005 development environment to achieve is a small can in the picture by clicking on the realization of search the shortest path a maze of things. All source code in.
Date : 2026-01-10 Size : 645kb User : 王德安
[Windows Develop] Graph_Th DL : 0: This a graph theory sample implementation for shortest path search.-This is a graph theory sample implementation for shortest path search.
Date : 2026-01-10 Size : 103kb User : Sagara
[Windows Develop] Graph-traversal DL : 0: 采用图的邻接矩阵或邻接表实现最短路径问题中图的存储，采用递归程序实现图的深度优先搜索（DFS）-Using adjacency matrix or adjacency list shortest path problem in memory map, using a recursive program implements graph depth-first search
Date : 2026-01-10 Size : 1kb User : 秦丽婷
[Windows Develop] huffman DL : 0: 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree, is a two - fork tree with the shortest path length. In many applications, it is often assigned to a node in a tree with a real number of meaning, which is called the right of the node. The product from the root node to the node between the node and the weight on the node is called the weighted path length (WPL) of the node. The sum of the weighted path length of all leaf nodes in the tree is called the weighted path length of the tree.)
Date : 2026-01-10 Size : 3.84mb User : breath