Search - shortest path graph

Search - shortest path graph - 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 : 2025-12-28 Size : 55kb User : gang
[Windows Develop] single-sourceshortestpath DL : 0: 给出一个带权有向图，该程序可以打印出从原点到其他所有点的最短路径。内容包含测试数据及问题的详细描述。-Give a weighted directed graph, the program can print out from the origin to all other points of the shortest path. Contains test data and detailed description of the problem.
Date : 2025-12-28 Size : 163kb User : 张蕾
[Windows Develop] ALGO-11 DL : 0: Prim algorithm to find shortest path in graph
Date : 2025-12-28 Size : 2kb User : saurabh
[Windows Develop] Floyd DL : 0: 实现Floyd算法，并求所示有向图中各顶点之间的最短路径及其长度。-Floyd algorithm to achieve, and for directed graph shown in between the vertex and the length of the shortest path.
Date : 2025-12-28 Size : 1kb User : wangjing
[Windows Develop] ALG_K_ShortPath DL : 0: this a program to count the shortest path in a graph-this is a program to count the shortest path in a graph
Date : 2025-12-28 Size : 378kb User : nitadewi
[Windows Develop] Algorithm-shortest-way-in-graph DL : 0: Shortest Path Algorithms in Graphs
Date : 2025-12-28 Size : 153kb User : mazik
[Windows Develop] Floyd DL : 0: folyd用来处理图论中最短路径问题。对传统的folyd算法进行了优化。-folyd to deal with the shortest path in graph theory problem. Folyd the traditional optimization algorithm.
Date : 2025-12-28 Size : 3.46mb User : 风清扬
[Windows Develop] poj DL : 0: pku 3613 Cow Relays 题意：给一个无向图，求从起点s到终点e尽力n条边的路径最小值。边的数量2<=t<=100(每条边可以重复遍历) 算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数，假设 i 到 k 要途径 2^l 条边，那么他可以被分为两段途径2^（l - 1）的路径。利用开始的输入，然后递推，就可以推出所有的状态。当需要找途经N条边的路径最小值时.将上面的值有效的组合起来. 上面求出了 1 2 4 8 16 …… 时的任意两条边的代价对应的二进制是 1 10 100 1000 10000 …… N可以拆成相应的二进制，然后用类似矩阵相乘的方法，往下推，就得到答案 m表示节点个数，(aXb)表示a行b列的矩阵一个，那么（1Xm）* path[ l ](mXm) 。最终复杂度为O（t^3logn） -Cow Relays Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1163 Accepted: 433 Description For their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have decided to run a relay race using the T (2 ≤ T ≤ 100) cow trails throughout the pasture. Each trail connects two different intersections (1 ≤ I1i ≤ 1,000 1 ≤ I2i ≤ 1,000), each of which is the termination for at least two trails. The cows know the lengthi of each trail (1 ≤ lengthi ≤ 1,000), the two intersections the trail connects, and they know that no two intersections are directly connected by two different trails. The trails form a structure known mathematically as a graph. To run the relay, the N cows position themselves at various intersections (some intersections might have more than one cow). They must position themselves properly so that they can hand off the baton cow-by-cow and end up at the proper finishing place. Write a program to help position the cows. Find the shortest path that
Date : 2025-12-28 Size : 1kb User : zhang
[Windows Develop] tudebianli DL : 0: 图的遍历，查照最短路径，利用递归和迭代的算法-Graph traversal, shortest path looked at the use of recursive and iterative algorithms
Date : 2025-12-28 Size : 368kb User : gg
[Windows Develop] 7 DL : 0: 图的大部分算法的程序实现，如建图，,dfs,bfs,图的最小生成树，最短路径等-Figure most of the program realization algorithm, such as building plans,, dfs, bfs, graph minimum spanning tree, shortest path, etc.
Date : 2025-12-28 Size : 980kb User : 冯玉谦
[Windows Develop] graph DL : 0: 计算机数据结构图的最短路径算法：D算法（输入权值和顶点）-Computer data structure diagram of the shortest path algorithm: D algorithm (input weights and vertex)
Date : 2025-12-28 Size : 219kb User : wang
[Windows Develop] graphtheory DL : 0: 5个关于图论的算法包括K短路问题 NLOGN问题二分图匹配问题费用流问题最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
Date : 2025-12-28 Size : 535kb 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 : 2025-12-28 Size : 103kb User : Sagara
[Windows Develop] ALGORITHME-DIJKSTRA-SUR-CARTE-FRANCE___Page DL : 0: Application of Dijkstra s algorithm on a map of France (bottle) with 8 cities (the distance in kilometers and tps are in villes.txt). Seeks the shortest path between two points of a graph (link> 0)
Date : 2025-12-28 Size : 108kb User : ss
[Windows Develop] shortest-path-searching-with-A-star-algorithm-in- DL : 0: pencarian jalur terpendek pada sebuah graph dengan menggunakan algoritma A* menggunakan visual basic 2008
Date : 2025-12-28 Size : 12kb User : shine
[Windows Develop] Installation-Setup DL : 0: Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportation. For large networks, the classical Dijkstra algorithm to compute shortest paths is too slow. And therefore have faster algorithms been developed in recent years. These new algorithms have in common that they use precomputation and store auxiliary data to speedup subsequent shortest-path queries.
Date : 2025-12-28 Size : 11kb User : manolin
[Windows Develop] ffloydl DL : 0: floyd算法，用于图论中的最短路路算法，使用matlab编写，简单实用 -floyd algorithm for shortest path routing algorithm in graph theory, the use of Matlab to prepare, simple and practical
Date : 2025-12-28 Size : 3kb User : chenxing1
[Windows Develop] sMySSeggh DL : 0: 最短路径法分词程序源码。将中文句子经过原子切分后生成一个有向无环图，然后使用用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。 -The shortest path method segmentation program source code. Chinese sentence After atomic segmentation, to generate a directed acyclic graph, and then use Dijkstra algorithm to calculate the shortest path from start to finish in order to achieve the Chinese word.
Date : 2025-12-28 Size : 416kb User : chenxing1
[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 : 2025-12-28 Size : 1kb User : 秦丽婷
[Windows Develop] graph DL : 0: 运用graph；寻找最短路径（最短时间/最少换乘）(Suppose following weighted directed graph representing a local subway route network, the vertices in the graph represent the important sites in the area, the arcs represents the existing subway routs, and the weight represent the time duration from one site to another one. Try to design a subway route query system to help the users find (a) the way to go from one site to another one in shortest time(weighted shortest path) (b) the way to go from one site to another one with minimal transfer(unweighted shortest path), for the routes with same transfer times choose the one costing shortest time.)
Date : 2025-12-28 Size : 104kb User : durian27

« 12 »