Search - paths problem

Search - paths problem - List

[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-19 Size : 2kb 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-19 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-19 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-19 Size : 3kb User : tiramisu
[Other] GA-VRP-MATLAB DL : 0: 应用遗传算法求解循环取货的路径优化问题，可以参考一下。-Application of genetic algorithm optimization cycle paths pickup problem。
Date : 2025-12-19 Size : 2kb User : tang
[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-19 Size : 268kb User : 冉戆
[Other] Allpath DL : 0: 问题描述若用无向图表示高速公路网，其中顶点表示城市，边表示城市之间的高速公路。试设计一个找路程序，获取两个城市之间的所有简单路径。基本要求（1）输入参数：结点总数，结点的城市编号（4位长的数字，例如电话区号，长沙是0731），连接城市的高速公路（用高速公路连接的两个城市编号标记）。（2）输入要求取所有简单路径的两个城市编号。（3）将所有路径（有城市编号组成）输出到用户指定的文件中。 -Problem descriptionIf use undirected graph said freeways, with vertex said city, edge said highway between the two cities.Try to design a route program, obtain all simple paths between the two cities. The basic requirements(1) input parameters: the total number of nodes, the nodes of the city number (4 digits long Numbers, telephone area code, for example, changsha is 0731), connected to the city expressway (with high-speed highway connects the two cities of number tags).(2) input requirements take number all simple paths of the two cities.(3) will all paths (a number of city) output to the user specified file.
Date : 2025-12-19 Size : 3kb User : 程悦
[Other] 算法设计 DL : 0: 问题描述：以一个m×n的长方形表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。基本要求：首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i,j,d）的形式输出，其中：（i,j）指示迷宫中的一个坐标，d表示走到下一坐标的方向。(Problem Description: a m * n rectangle represents the maze, and 0 and 1 indicate maze paths and obstacles, respectively. Design a program, for any set of mazes, to find a passage from the entrance to the exit, or draw no access to the conclusions. Basic requirements: first of all, to achieve a list of storage structures for the stack type, and then write a solution to the maze of non recursive procedures. The resulting path is output in the form of three tuples (I, J, d), where: (I, J) indicates a coordinate in the maze, and D indicates the direction to the next coordinate.)
Date : 2025-12-19 Size : 2kb User : beautiful