Search - graph algorithms

Search - graph algorithms - List

[Data structs] GraphCC DL : 0: 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
Date : 2025-12-25 Size : 1kb User : 黄牛
[Data structs] tuzhaosewenti DL : 0: 图着色问题的回溯算法，图着色问题是一个NP-完全问题.-Graph Coloring Problem of backtracking algorithms, graph coloring problem is an NP-complete problem.
Date : 2025-12-25 Size : 1kb User : 张金水
[Data structs] 4 DL : 0: 迷宫问题是《数据结构》中是作为栈的典型应用举例,且迷宫是以二维数组来存储的,表面上看似乎迷宫问题是一种特殊问题的解决方法,其实迷宫问题是一种特殊形式的图的问题。因此,迷宫问题总是可以转化为图的问题来解决的。讨论如何将迷宫问题转化成图的问题,以及如何利用图的算法来解决迷宫问题。-Maze problem is that data structure is as a stack of typical application, for example, and the maze is based on two-dimensional array to store, and the surface it seems that the issue of the maze is a special solution to the problem, in fact, the maze problem is a special form the problem of Fig. Therefore, the maze problem can always be converted to map the problem to solve the problem. Discuss how the problem will be transformed into a maze map, as well as how to use graph algorithms to solve the maze problem.
Date : 2025-12-25 Size : 153kb User : shirley
[Data structs] aa DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。-Graph Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through.
Date : 2025-12-25 Size : 1kb User : 王兵
[Data structs] GraphFunc DL : 0: 数据结构中有关图的算法，如图的遍历，拓扑排序等·！-Data structure relating to graph algorithms, in Figure Ergodic, topological sort, etc.!
Date : 2025-12-25 Size : 8kb User : huang
[Data structs] graph DL : 0: 图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.
Date : 2025-12-25 Size : 17kb User : c4pt0r
[Data structs] graph DL : 0: 提供了用c++编写的图的数据结构及相关的算法，非常不错的，-Provided by c++ Prepared map data structure and related algorithms, very good,
Date : 2025-12-25 Size : 579kb User : tanghuang
[Data structs] C DL : 0: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Date : 2025-12-25 Size : 15kb User : 海霞
[Data structs] Graph DL : 0: 完全由C语言实现的图的相关操作，就是清华大学数据结构书里的图的所有算法的实现-Solely by the C language implementation of related plans to operate, that is, Tsinghua University, the data structure of the book' s map of the implementation of all algorithms
Date : 2025-12-25 Size : 84kb User : 季
[Data structs] create_algraphic DL : 0: 图的建立，里面包括有向图和无向图的建立，还有带权值的建立方法，也有图的输出算法，图的存储结构是以邻接链表的形式存储的。-The establishment of plans, which include the maps and the establishment of undirected graph, as well as with the establishment of methods of weight, but also the output graph algorithms, map adjacent to the storage structure is stored in the form of list.
Date : 2025-12-25 Size : 2kb User : 韩寒
[Data structs] graph DL : 0: 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
Date : 2025-12-25 Size : 39kb User : young
[Data structs] CreateGraph.cc DL : 0: 图论算法，在Linux平台编写，可以运行，有运行结果-Graph theory algorithms, the preparation of the Linux platform, you can run, and the results
Date : 2025-12-25 Size : 8kb User : 赵福生
[Data structs] Algorithms DL : 0: 压缩包中包括几个常用算法对应的POJ练习题的实现，包括，无向图的欧拉回路，点的割集，TRIE树，最优比率生成树，最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, the optimal ratio spanning tree, the smallest tree
Date : 2025-12-25 Size : 5kb User : ACMaryland
[Data structs] graph DL : 0: 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest binary tree, DFS, BFS, and topological sort.
Date : 2025-12-25 Size : 926kb User : 许娜娜
[Data structs] graph.yangxu DL : 0: 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth traversal traverse to attempt to grasp the basis of some commonly used algorithms, such as minimum spanning tree, topological sorting, shortest path and so on.
Date : 2025-12-25 Size : 248kb User : 胡顶豪
[Data structs] basicoperationformap DL : 0: 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map, graph traversal (such as DFS and BFS), the minimum spanning tree, from a source point Zhen each vertex to the shortest path, etc.
Date : 2025-12-25 Size : 239kb User : seckCoder
[Data structs] graph DL : 0: 数据结构图一章的所有算法，希望对大家对图的理解有帮助。图一直被认为是很难理解的，有关图的算法，理解很困难，更不用去写了-Data structure diagram of a chapter of all algorithms, we want to help the understanding on the map. Figure has been considered difficult to understand, the graph algorithms, understanding very difficult, not to write
Date : 2025-12-25 Size : 6kb User : 李自华
[Data structs] Graph DL : 0: 数据结构中模拟图算法的演示系统，实现一些图算法的基本功能-Data structure to simulate the demonstration system graph algorithms, graph algorithms to achieve some of the basic functions
Date : 2025-12-25 Size : 270kb User :
[Data structs] Algorithms.Design-Michael.T.Goodrich DL : 0: 本书系统地阐述了算法设计的方法、技术和应用实例。全书内容包括基础算法、基本数据结构、基本算法设计技术、图算法、网络流和匹配、文本处理算法、数论算法、网络算法、NP完全性、近似算法、回溯法和分枝限界法、外存算法、并行算法和在线算法。Java实现示例覆盖了软件设计方法、面向对象实现问题和算法的实验性分析。这些典型问题的Java应用示例分布在不同的章节中。此外，书中以大量图例说明算法的工作过程，使算法更加易于理解和掌握。　　本书适合作为高等院校计算机专业本科生和研究生算法设计课程的教材，也可作为从事软件开发和工程设计的专业人员的参考书。此外，算法爱好者和参加各种程序设计大赛的选手也可把本书作为参考用书。-The book systematically elaborated algorithm design methodologies, techniques and application examples. The book covers basic algorithms, basic data structures, basic algorithm design techniques, graph algorithms, network flow and matching, text processing algorithms, number theoretic algorithms, network algorithms, NP complete, approximation algorithm, backtracking and branch and bound method, the external memory algorithms, parallel algorithms and online algorithms. Java implementation of the sample covers software design methods, object-oriented realization of the experimental analysis of problems and algorithms. These typical Java application examples are distributed in different sections. In addition, the book shows a large number of legends of the working process of the algorithm, the algorithm easier to understand and master. The book is suitable as institutions of higher learning computer professional undergraduate and graduate students algorithm design courses, textbooks, refe
Date : 2025-12-25 Size : 8.24mb User : wb
[Data structs] bipartite-graph-algorithms DL : 0: 本文初步介绍了二分图有关的基本算法，和常用的建模方法-The paper initially describes the bipartite graph algorithms, and modeling
Date : 2025-12-25 Size : 559kb User : 陈融一

« 12 3 4 5 6 »