Search - graph algorithms

Search - graph algorithms - List

[Other] GraphLib_src DL : 0: 图的数据结构的实现。A fundamental graph library implements data structure and algorithms that you must have learned from text books. The Graph data structure is implemented as its natural structure. Taking advantage of C++ STL associative container, it is of high performance and efficiency when deletion insertion and search.-Graph data structure implementation. A fundamental graph library implements data structure and algorithms that you must have learned from text books. The Graph data structure is implemented as its natural structure. Taking advantage of C++ STL associative container, it is of high performance and efficiency when deletion insertion and search.
Date : 2025-12-25 Size : 29kb User : 南亮亮
[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-25 Size : 6kb User : mhb
[Other] hj DL : 0: 图的算法实现（1）将图的信息建立文件；（2）从文件读入图的信息，建立邻接矩阵和邻接表；（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 -Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Date : 2025-12-25 Size : 103kb User : 陈阳
[Other] DS_PKU DL : 0: 北大版本的数据结构教程对应的源代码，其中包括链表，树，图等经典数据结构和一些算法。-North version of the data structure corresponding to the source code tutorials, including linked lists, trees, and other classic graph data structure and some algorithms.
Date : 2025-12-25 Size : 75kb User : Ra
[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-25 Size : 3kb User : atom
[Other] tubianli DL : 0: 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
Date : 2025-12-25 Size : 393kb User : 李海涛
[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-25 Size : 40kb User : 夏秋
[Other] 2 DL : 0: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。对于八皇后问题的实现，如果结合动态的图形演示，则可以使算法的描述更形象、更生动，使教学能产生良好的效果。-8 Queen s problem is an old and well-known problem is a typical example of backtracking algorithms. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8X8 grid on the display of the chess Queen eight, making it unable to attack each other, that is, any two can not be Queen s in the same line, the same row or the same slash on how many kinds of facing law. Gaussian 76 program that. In Berlin in 1854 different chess magazines published author of 40 different types of solution, then using graph theory was the method to solve the 92 kinds of results. 8 Queen s problem for the realization, if the combination of dynamic graphics presentation, you can make the image description algorithm, more vivid, so that teaching can have a very positive impact.
Date : 2025-12-25 Size : 735kb User : 楼昊
[Other] DAG DL : 0: 若在DGA图中存在一个顶点r，在r和图中所有其他顶点之间均存在由r出发的有向路径，则称该DAG图有根，试编写求DAG图的根的算法。 -If there is a DGA map vertex r, in r and the graph all the other vertices exist in between the departure from the r to the path are said to have roots in the DAG plans, test plans prepared by seeking the root of DAG algorithms.
Date : 2025-12-25 Size : 14kb User : chenyucong
[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-25 Size : 80kb User :
[Other] pku.tar DL : 0: PKU(http://poj.org/)的大量题目解答，都是被Accept的源代码，包括排序、搜索(二分、宽度优先、深度优先)、动态规划、图算法等类型，详见其中的summary文件-a large number of solutions for questions from PKU (http://poj.org/), all Accepted source code, including sorting, searching, (binary-search, breadth-first, depth-first), dynamic programming, graph algorithms and other types, for more details, see the summary file included.
Date : 2025-12-25 Size : 64kb User : joey.zhao
[Other] maxflow-v3.02.src DL : 0: 图的最大流算法实现构造图，寻找增光路径，求取图的最大流-Graph algorithms to achieve maximum flow
Date : 2025-12-25 Size : 18kb User : 关小禾
[Other] UNDONE(2) DL : 0: 图算法的一个大作业，根据输入矩阵构成图，不同的值表示四个方向邻接类型，在图中搜索死路，活路的算法。-A large job graph algorithms, based on the input matrix block diagram, showing the four different values of the direction of the adjacent type, the search in the drawing die, the way out of the algorithm.
Date : 2025-12-25 Size : 5kb User : Leezhihao
[Other] graph-theory-common-algorithms- DL : 0: 图论算法包括生长树迪杰斯特拉最大流佛洛依德算法-graph theory common algorithms
Date : 2025-12-25 Size : 10kb User : 秦
[Other] shotestpath1.c DL : 0: graph algorithms bfs and dfs
Date : 2025-12-25 Size : 1kb User : gulla3012
[Other] graph DL : 0: 在社会网络中，采用MATLAB构建最小图和查看两个图是否相似的两个算法-In social networks, using MATLAB to build a minimum figure and view two graphs is similar to the two algorithms
Date : 2025-12-25 Size : 2kb User : 赵利民
[Other] dinic DL : 0: 图论算法中基于分层网络的最短增广链算法，用于解决最大流问题-Graph algorithms in the shortest augmenting chain algorithm based on a hierarchical network for solving the maximum flow problem
Date : 2025-12-25 Size : 1kb User : 纪亚宝
[Other] graph-theory-algorithm-MATLAB-code DL : 0: 图论算法及其MATLAB 程序代码,包含了常用的图论算法，如：最短路径算法。-Graph algorithms and MATLAB code, including commonly used graph theory algorithms, such as: shortest path algorithm.
Date : 2025-12-25 Size : 47kb User : 夏绍燕
[Other] boost-graph DL : 0: boost图论算法调用模板，只需要修改个别参数，就可以直接套用代码，省的自己实现-boost graph algorithms call template, only need to modify individual parameters, you can directly apply the code, to achieve their own province
Date : 2025-12-25 Size : 9kb User : 黄立·
[Other] Graph traversal algorithm DL : 0: 图的搜索（遍历）算法是图型结构相关算法的基础，编写程序演示无向图三种典型存储结构的建立和（搜索）遍历过程。(The search (or traversal) algorithm of the graph is the basis of graph-structure-related algorithms. The program is written to demonstrate the establishment and (search) traversal process of the three typical storage structures of undirected graphs.)
Date : 2025-12-25 Size : 1kb User : 唯唯王

« 12 »