Search - SHORTEST-PATHS

Search - SHORTEST-PATHS - List

[Other] 邻接矩阵求最短路径 DL : 0: 邻接矩阵的最短距离-adjacency matrix is the shortest distance
Date : 2025-12-18 Size : 268kb User : 照茜
[Other] 北京交通大学校园旅游导航系统 DL : 0: 北京交通大学校园旅游导航系统，利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
Date : 2025-12-18 Size : 308kb User : 陈勋
[Other] Graph DL : 0: 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。-I prepared a number of graph theory code, including deep search, minimum spanning tree, shortest path, notes I wrote in great detail, we can serve as a reference entry.
Date : 2025-12-18 Size : 3kb User : 彭立勋
[Other] Shortest DL : 0: c++开发最短路径，可用于地理信息系统专业-c++ development of the shortest path can be used to Geographic Information Systems Professional
Date : 2025-12-18 Size : 165kb User : 刘波
[Other] ShortestPaths DL : 0: Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
Date : 2025-12-18 Size : 2kb User : jazz
[Other] ShortestPathsEdge DL : 0: In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
Date : 2025-12-18 Size : 2kb User : jazz
[Other] Shortest_path_counting DL : 0: acm算法设计：描述：国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。输入：一整数n为行数和列的棋盘。0 < n <=16 输出：数量的最短路径。例输入： 3或4 例输出： 6或20 -Description： A chess rook can move horizontally or vertically to any square in the same row or in the same column of a chessboard. Find the number of shortest paths by which a rook can move from one corner of a chessboard to the diagonally opposite corner。 Input： a interger number n is row and column of chessboard. 0 < n <=16 Output： the number of shortest paths. Sample Input： 3or4 Sample Output： 6or20
Date : 2025-12-18 Size : 207kb User : 张波
[Other] migong DL : 0: 迷宫问题，有详细的注释，实现了自己设置入口出口，可找所有路径和最短路径并输出所有路径-Maze problem, there are detailed notes, to achieve its own entrance exit he could find all the paths and the shortest path and the output of all paths
Date : 2025-12-18 Size : 2kb User : 朱科圣
[Other] SchoolScenes_Guide DL : 0: 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。要求事先一下功能：（1）查询各顶点的相关信息。（2）查询图中任意两个景点之间的最短路径。（3）查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile and other information, the graph edges, said the road between sites, storage path length information. Requested in advance what functions: (1) query the vertex of the relevant information. (2) query graph between any two sites the shortest path. (3) The query graph between any two spots of all paths.
Date : 2025-12-18 Size : 507kb User : 欧阳云飞
[Other] Dijkstra DL : 0: 求解Dijkstra 前k条最短路径，非常实用，编译已通过-Dijkstra solved before the k shortest paths
Date : 2025-12-18 Size : 1kb User : 花无缺
[Other] VRPH-1.0.0 DL : 0: Furthermore, the simulator actually build in another algorithm - Dijikstra Algorithm. This algoritm is the best and fastest algo in solving shortest path problem. It s actually used to compare wtih GA in solving a specified situation. Simulator also build in with all potential path generation mechanism, but it depend on maps and the source and destnation location that user choose. Sometimes, it will take long time to get all the posible paths generated. However, this mechanism is actually implemented in a thread
Date : 2025-12-18 Size : 134kb User : celine
[Other] TravelerTSP DL : 0: 旅行商问题(TSP问题)就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本题假定该旅行商从第1个城市出发。-Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to the original starting point, calculate all possible paths in the shortest path length one. This question assumes that the traveling salesman starting from a city.
Date : 2025-12-18 Size : 1kb User : Cindy
[Other] zuiduanlujing DL : 0: 解决动态规划问题中的一个重要问题最短路径问题，通过各条路径的权重，最后得出最优的路径选择。-The shortest path problem, an important problem in the dynamic programming problem through various paths of the right weight, and finally arrive at the optimal path selection.
Date : 2025-12-18 Size : 3kb User : tiramisu
[Other] maze DL : 0: 数据结构；迷宫算法；输出最短路径和所有路径-Data structure maze algorithm outputs the shortest path and all paths
Date : 2025-12-18 Size : 1kb User : wj
[Other] shortestpath DL : 0: 输入图，输出最短路径。输入的图需要是起点距离终点格式-The program first read the input file to create node link list with name of nodes and count the number of nodes. Then it reread the input file to form the adjacency matrix of the graph. It has functions of creating, adding, deleting link list, as well as finding shortest path and printing result. It can point out if there is any disconnected graph form the source node and can print out an alternative shortest path of a node. However, the shortcoming of the program is that it can only point out one alternative shortest path of the nodes. If there are many shortest paths of a node, the program might not point out all of them.
Date : 2025-12-18 Size : 5kb User : JU Sida
[Other] Shortest-Path DL : 0: 在网络通信中，经常需要求最短路径。但完全采用最短路径传输有这样一个问题：如果最终在两个终端节点之间给出的最短路径只有一条，则在该路径中的任一个节点或链路出现故障时，信号传输将面临中断的危险。因此，对网络路由选择作了以下改进：为任意两节点之间通信提供两条路径供其选择，即第一最短路径、第二最短路径.使用数据结构编程实现，程序=算法+数据结构的很好体现-In network communication, often request the shortest path. But totally shortest path transmission has a problem: If the shortest path between two terminal nodes eventually given only one, then any one node or link in the path fails, the signal transmission will face disruption danger. Therefore, the network routing made the following improvements: two paths for their choice of any communication between two nodes, namely the shortest path first, second shortest path using the data structure programming, program = algorithm+ data structure. the well reflected
Date : 2025-12-18 Size : 268kb User : 冉戆
[Other] Desktop DL : 0: 计算网络节点介数，节点的介数为网络中所有的最短路径中经过该点的数量比例。-Calculate the number of referrals referral network node number of nodes in the network all the shortest paths through the ratio of the number of points.
Date : 2025-12-18 Size : 2kb User : 闫青