Search - graph algorithms

Search - graph algorithms - List

[Other resource] GraphCC DL : 0: 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
Date : 2008-10-13 Size : 1.57kb User : 黄牛
[Other resource] mathmodel DL : 0: 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm)
Date : 2008-10-13 Size : 5.65mb User : zhxj
[Other resource] youxiangtu DL : 0: 这是强连通图的一个经典算法，希望大家来分享哦，多多指教-This is the graph-a classic algorithms, we hope to share Oh, exhibitions
Date : 2008-10-13 Size : 1.72kb User : 肖晨
[Other resource] algorithmanddsbyfu DL : 1: 傅清祥算法与数据结构它覆盖了《计算机学科教学计划1993》中开列的关于算法与数据结构主科目的所有知识单元。其主要内容有：算法与数据结构的概念、抽象数据类型（ADT）、基于序列的ADT（如表，栈，队列和串等）。反映层次关系的ADT（如树，堆和各种平衡树等）、关于集合的ADT（如字典，优先队列和共查集等）、算法设计的策略与技巧、排序与选择算法、图的算法、问题的计算复杂性、并行算法。全书强调“算法”与“数据结构”之间密不可分的联系，因而强调融数据类型与定义在数据类型上的运算于一体的抽象数据类型，为面向对象的程序设计方法打下扎实的基础。本书以知识单元为基本构件，具有可拆卸性和可重组性，内容丰富，表述详细，适合不同类型的院校按照不同的培养规格组织教学，其中基础部分可作为计算机学科各专业本科生的教材，高级专题部分可作为高年级本科生或研究生的教材。 -li, algorithm and data structure which covers the "Computer Science Teaching Program 1993" listed on the operator Law and data structures of all the main subjects of knowledge modules. Its main contents are : algorithm and data structure of the concept of abstract data types (ADT), Based on the sequence of ADT (table, stack, queue and strings, etc.). Reflect the level of relations between the ADT (such as trees, and balancing the heap tree, etc.), on the set of ADT (as a dictionary. Priority Queue and unearthed collection, etc.), algorithm design strategies and techniques, sorting and selection algorithms, graph algorithms, the computational complexity, parallel algorithm. Guidebook stressed that "algorithms" and "data structures," the inextricable link betwee
Date : 2008-10-13 Size : 11.26mb User : wu
[Other resource] Graph_Algorithms_code DL : 0: book: Algorithms in C++, Part 5 (Graph Algorithms) code-book : Algorithms in C, Part 5 (Graph Algorithms) code
Date : 2008-10-13 Size : 9.24kb User : dedema
[Other resource] AlgorithmsinC++Part5 DL : 0: Algorithms in C++, Part 5 (Graph Algorithms) code-Algorithms in C, Part 5 (Graph Algorithms) code
Date : 2008-10-13 Size : 9.27kb User : dedema
[Other resource] AlgorithmsinJava_Part5(GraphAlgorithms) DL : 0: Algorithms in Java, Part 5 (Graph Algorithms) code
Date : 2008-10-13 Size : 9.05kb User : dedema
[Other resource] AlgorithmsinC_Part5(GraphAlgorithms)code DL : 1: Algorithms in C, Part 5 (Graph Algorithms) code
Date : 2008-10-13 Size : 7.57kb User : dedema
[Other resource] ERRandomGraph DL : 2: ER随机图算法，matlab程序，复杂网络仿真-ER random graph algorithms, Matlab procedures, complex network simulation
Date : 2008-10-13 Size : 3.17kb User : jiangnan
[Other resource] PUMAdemos DL : 0: ％％％ Demos for PUMA algorithms ％％％ We present four matlab demos for PUMA. demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images. All you need to do is to run each of the demos. Please be sure that all the files are put on an accessible path for matlab. Notice that this code is intended for research purposes only. For further reference see \"Phase Unwrapping via Graph Cuts, IEEE Transactions on Image Processing, 2007
Date : 2008-10-13 Size : 55.23kb User : 类坐困
[Other resource] 图的遍历演示 DL : 0: 一．问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二．基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth - first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.
Date : 2008-10-13 Size : 2.51kb User : 雨后阳光
[Other resource] “八皇后”问题递归法求解 DL : 0: “八皇后”问题递归法求解 * 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen's" recursive method * 8 Queen's problem is one of the oldest and famous, is backtracking algorithms typical example.18508X8 Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, and later was used graph theory methods to come up with 92 kinds of results.
Date : 2008-10-13 Size : 2.56kb User : 美美