Search - shortest path algorithms

Search - shortest path algorithms - List

[Other] graph1 DL : 0: 1、图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。图的存储结构可采用：邻接矩阵、邻接表。要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法 2、图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。 3、图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11） 4、图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。 -1, map storage structure definition and graph types to create graph: directed graph, undirected graph, to the network without the network. Map storage structure can be: adjacency matrix, adjacency table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, Graph Traversal: Non-recursive depth-first search algorithms, breadth-first search algorithm. 3, graph traversal depth of applications: for undirected connected graph of the joint points (textbooks P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from vertex v0 to The rest of each vertex of the shortest path requires the output of the vertex of the path information.
Date : 2025-12-22 Size : 6kb User : mhb
[Other] Graph2 DL : 0: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum spanning tree, shortest path algorithm.
Date : 2025-12-22 Size : 307kb User : 刘飞
[Other] graph_ DL : 0: //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)
Date : 2025-12-22 Size : 3kb User : atom
[Other] xq DL : 0: 图论中最短路算法，最小生成树，最大匹配与最佳匹配的算法，旅行商问题，求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
Date : 2025-12-22 Size : 40kb User : 夏秋
[Other] work DL : 0: 最短路径算法，比其它算法更简洁，但是只能针对正赋权-Shortest path algorithm, more concise than the other algorithms, but for now can only empower
Date : 2025-12-22 Size : 2kb User : 肖黎
[Other] shortestPath DL : 0: 在visual C++上写的动态规划算法在图论中旅行商问题上的应用，适合算法分析的朋友。-In visual C++ to write the dynamic programming algorithm to find the shortest path in the graph the application of suitable algorithms friends.
Date : 2025-12-22 Size : 80kb User :
[Other] Untitled DL : 0: 属于一群算法，用于通用性解决最短路径问题，方便快捷。-Belongs to a group of algorithms for solving shortest path problem versatility, convenience
Date : 2025-12-22 Size : 2kb User : 刘凯瑞
[Other] bgraph DL : 0: 求图的最短路径使用向后递推算法求 C语言实现-In the figure, the shortest path using the backward recursive algorithms to find the C language
Date : 2025-12-22 Size : 1kb User : 李殷
[Other] Floyd DL : 0: 用佛洛依德算法求有向图图的任意两点的最短路径-Algorithms to find the shortest path to any two points of the Figure with Freud
Date : 2025-12-22 Size : 2kb User : 是
[Other] fgh DL : 0: 应用floyd算法和普利姆算法建编写的最短路经，实现最短路径的建立并输出，-The application the floyd algorithms and Puli Mu algorithm built write the shortest path to achieve the establishment of the shortest path and output,
Date : 2025-12-22 Size : 234kb User : 王康
[Other] Desktop DL : 0: 题目：假设迷宫由m行n列构成，有一个入口和一个出口，入口坐标为(1，1)，出口坐标为(m，n)，试找出一条从入口通往出口的最短路径。设计算法并编程输出一条通过迷宫的最短路径或报告一个“无法通过”的信息。要求：用栈和队列实现，不允许使用递归算法。一、需求分析 -Topic: Assuming maze consisting of m rows and n columns form, having an inlet and an outlet, the inlet coordinates (1,1), the export coordinates (m, n), try to find an exit from the entrance to the shortest path. Design algorithms and program outputs a shortest path through a maze or to report a " not pass" information. Requirements: The stack and queue implementations are not allowed to use recursive algorithm. First, the needs analysis
Date : 2025-12-22 Size : 34kb User : 雷老虎
[Other] Project4_BallmanFord DL : 0: (图论)实现负权重转换(Bellman-Ford) 对于输入的任何一个拓扑(部分边的权重为负)，要求变换网络中边的权重，任意两节点间的最短路不变，输出变换后各边权重。如果网络中存在负环，程序要有报警功能。算法主体写在CGraph类中-(Graph theory) to achieve negative weight conversion (Bellman-Ford) to the input of any topology (some edge weight is negative), requiring transform the network edge weights between any two nodes of the shortest path unchanged, the output transform each edge weights. If the negative loop exists in the network, the program should alarm function. Algorithms written in CGraph class body
Date : 2025-12-22 Size : 7.82mb User : wendy
[Other] algorithm DL : 0: 1、Bellman-FordJ解决单源最短路径问题 c++实现 2、所有点之间最短路径问题 3、8皇后问题回溯法 4、0-1背包问题回溯法 -Bellman-Ford algorithm All-pairs shortest path (choose one from the three algorithms) 8-queen problem (back backing) 0-1 knapsack problem (back tracking)
Date : 2025-12-22 Size : 10kb User : 薛影奇
[Other] Data-Structure-and-algorithms-CPP DL : 0: c++实现数据结构的所有代码。包括线性表，树，图，排序，hash等。线性表实现堆栈，队列及约瑟夫环等多个应用，树实现哈夫曼树编码及译码，AVL树，线索化二叉树，森林和二叉树的相互转化等等，图实现图的几种建立方法，拓扑排序，最短路径，最大连通子图，双连通分量，最小生成树，关键路径算法等等，排序实现归并排序，快速排序，堆排序，shell排序，冒泡排序，选择排序，插入排序等，并对性能进行分析。hash实现闭散列表，开散列表，带溢出表的内散列表等，并使用5种hash函数。帮助同学们系统的学习数据结构及算法。-c++ code that implements all the data structures. Including linear tables, trees, graphs, sorting, hash, etc. Achieve linear form stacks, queues, and multiple applications, such as Josephus, tree Huffman coding and decoding trees, AVL trees, threaded binary tree, binary tree forest and into each other, etc., to achieve several graphs in Figure establishment method, topological sorting, shortest path, maximum connected subgraph, two connected components, minimum spanning tree, the critical path algorithms, etc., to achieve sort merge sort, quick sort, heap sort, shell sort, bubble sort, selection sort, insertion sort, etc. and to analyze performance. hash hash achieve closed, open hash table, the hash table with overflow in the other tables, and using 5 kinds of hash functions. Help students learn the system data structures and algorithms.
Date : 2025-12-22 Size : 6.01mb User : 汪景行
[Other] software-design-I DL : 0: c++实现的非常详细的数据结构与算法代码，队列，链表，三元组，哈弗曼树，树的各种递归，非递归遍历算法，树与森林相互转化算法，图的深度，广度优先搜索算法，双连通算法，强连通算法，拓扑排序算法，最短路径算法，哈希，快速排序，归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non recursive traversal algorithm, tree and forest mutual transformation algorithm, graph depth, breadth first search algorithm, double connectivity algorithm, strong connectivity algorithms, the topological sort algorithm, shortest path algorithm, hash, quick sort, merge sort etc..
Date : 2025-12-22 Size : 7.41mb User : 田印
[Other] guangwangluo DL : 0: 用opnet编写的光网络业务疏导模型算法，主要是分层模型的建立，用dijkastra算法跑出最短路径-Optical network traffic grooming algorithms model opnet written mainly based hierarchical model, ran the shortest path algorithm with dijkastra
Date : 2025-12-22 Size : 457kb User : 杨永涛
[Other] Multi-level--algorithms DL : 0: 多级决策算法，可以用于解决最短路径问题，效果良好-Multi-level decision-making algorithms, can be used to solve the shortest path problem, the effect is good
Date : 2025-12-22 Size : 328kb User : 潘想
[Other] Floyd DL : 0: Floyd算法：Floyd算法是一个经典的动态规划算法,用来计算两点之间最短路径。-Floyd algorithms: Floyd algorithm is a classical dynamic programming algorithm is used to calculate the shortest path between two points.
Date : 2025-12-22 Size : 167kb User : 姚强
[Other] floyd DL : 0: 图论算法中的floyd算法，用于解决最短路问题，其中还包括随机网络生成-Graph theory algorithms floyd algorithm for solving the shortest path problem, which also includes random network generation
Date : 2025-12-22 Size : 3kb User : 纪亚宝
[Other] code DL : 0: 数据结构各种算法：最短路径、最小生成树、几种排序、二叉树的操作、查询算法等-Data structure of the various algorithms: shortest path, minimum spanning tree, some sort of binary operations, query algorithms
Date : 2025-12-22 Size : 17kb User : 张航

« 12 »