Search - paths problem

Search - paths problem - List

[Data structs] youxiangxunhuantumigongwentiqiujie DL : 0: 有向循环图迷宫问题求解，普通迷宫问题要求找出从迷宫入口到出口的所有路径，而此次研究的主要内容是找出有向循环图中的回路（即容易造成流程死循环的地方），消除循环并找出死结点。与此同时，找出死结点后，其他顶点最终都能够到达迷宫的出口。在实际审计过程中的应用意义则为：确定审计工作在哪一个负责部门完成后，是无法继续向其他负责部门传递审计工作直到完成整个审计流程的。-Directed cyclic graph maze problem solving, general maze problem requires to find the entrance to the export from the maze of all the paths, but this study is to identify the main contents of the loop to loop graph (that is likely to cause death cycle process where) to eliminate the loop and find the knot points. At the same time, find the knot points, the other vertices are eventually able to reach the maze exit. In the real significance of the audit process was: to determine the audit department in charge after the completion of which it is impossible to transfer to other heads of departments to complete the audit until the audit process.
Date : 2025-12-19 Size : 1kb User : wenwen
[Data structs] K_ShortestPath DL : 0: 如果你对前K条最短路径一类的问题感兴趣,那么这是不错的参考资料,希望对你有所帮助.-If you pre-K shortest paths problem for a class of interest, then this is a good reference, hope this helps.
Date : 2025-12-19 Size : 2.84mb User : 花无缺
[Data structs] campus_tour_program DL : 0: 问题描述：用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。设计要求： 1．查询各景点的相关信息； 2．查询图中任意两个景点间的最短路径； 3．查询图中任意两个景点间的所有路径。 -Problem Description: The undirected graph that spot in your school campus plan, said the main attractions of vertices, the number of storage sites, name, profile and so on. Design requirements: 1. Query information about tourist attractions 2. Query graph in any shortest path between two sites 3. Query graph between any two spots of all paths.
Date : 2025-12-19 Size : 263kb User : zilin
[Data structs] maze-problem DL : 0: 实现迷宫问题的求解：以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。-Achieve maze problem solving: a long-m* n matrix that maze, 0 and 1, respectively, in the maze of paths and obstacles. Design a program, for any set of the maze, find a pathway from the entrance to the exit, or come to the conclusion there is no path.
Date : 2025-12-19 Size : 2kb User : GUM
[Data structs] The-shortest-path-problem DL : 0: 最短路径问题。两个点A与B之间有多条路，从A到B有多条方案。求A到B的最短路径-The shortest path problem.There are several paths from point A to B.Now we want to know which path is the shortest.Ihis program can help us desolve the Transportation problem
Date : 2025-12-19 Size : 4kb User : zhangyue
[Data structs] ShortestPath DL : 0: 本文件是关于最短路径问题的课程设计，分析了图问题中关于两点最短路径的问题，采用Floyd算法，演示了国内两城市可达的最短距离。文件中包括源代码、测试覆盖率报告、原始数据、课程设计报告。对正在研究数据结构中图论方面的同学有一定帮助。-This document is on the shortest path problem, curriculum design, and analysis of graph problems on the two shortest paths using Floyd algorithm shows the shortest distance between two cities up to the domestic. The file includes source code, test coverage reports, raw data, curriculum design report. Must help students that are studying the data structure in graph theory.
Date : 2025-12-19 Size : 292kb User : yyp
[Data structs] the-long-line DL : 0: 实验名称：用动态规划法求解最长路径问题设计动态规划算法求解最长路径问题（见下面附录部分），要求程序能根据给定的图作为输入，输出最长路径的长度及一条最长的路径。-Experiment name: the dynamic programming method for solving the longest path problem design dynamic programming algorithm for the longest path problem (see the appendix section below), the program according to a given graph as input, output length of the longest path and a longest paths.
Date : 2025-12-19 Size : 860kb User : Tin
[Data structs] maze-game DL : 0: 迷宫问题的求解过程可以采用回溯法即在一定的约束条件下试探地搜索前进，若前进中受阻，则及时回头纠正错误另择通路继续搜索的方法。从入口出发，按某一方向向前探索，若能走通，即某处可达，则到达新点，否则探索下一个方向；若所有的方向均没有通路，则沿原路返回前一点，换下一个方向再继续试探，直到所有可能的道路都探索到，或找到一条通路，或无路可走又返回入口点。在求解过程中，为了保证在达到某一个点后不能向前继续行走时，能正确返回前一个以便从下一个方向向前试探，则需要在试探过程中保存所能够达到的每个点的下标以及该点前进的方向，当找到出口时试探过程就结束了-Maze problem solving process can be used backtracking that under certain constraints exploratory search forward, if the advance is blocked, then go back in time to correct the errors continue to choose another path searching method. Starting the entrance, according to a forward direction to explore, if go through, that somewhere up, the new point is reached, otherwise explore the next direction if all directions are no paths, then a little before returning along the same route, replaced in one direction and then continue to test until all possible roads to explore, or find a path, or no way out but to return the entry point. Under the former in the solution process, when you can not move forward in order to ensure continued walking after reaching a certain point, in order to be able to return to the correct one the next tentative forward direction, you need to save in the test process of each point can be achieved scale and direction of the point forward, when the temptation to find
Date : 2025-12-19 Size : 1kb User : 林斌