Search - graph - CodeBus

Search - graph - List

[Other] 5班8号周前平 DL : 0: 输入一个有向图，用深度优先搜索，判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
Date : 2008-10-13 Size : 12.47kb User : 周子藤
[Other] gouzaoerchashu DL : 0: 构造二叉树，简单的排序，图的遍历，希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
Date : 2008-10-13 Size : 7.5kb User : 王全镇
[Other] jiandantudebianli DL : 0: 构造二叉树，简单的排序，图的遍历，希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
Date : 2008-10-13 Size : 1.69kb User : 王全镇
[Other] haokan DL : 0: 试扩充深度优先搜索算法，在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中，指针t指向生成森林上具有图顶点v信息的根结点。（提示：在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前，建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。） -try to expand the depth-first search algorithm, the traverse of the process to establish the forest generation of children left-right List brothers. The first algorithm to void Graph : : DFS (const int v, int visited [], TreeNode
Date : 2008-10-13 Size : 1.2kb User : dfssd
[Other] euler2 DL : 0: 对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路.-for the given graph G, the map after each side exactly two times the loop known as the G-Euler circuit.
Date : 2008-10-13 Size : 1.3kb User : 水若寒
[Other] jige DL : 0: 这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-This is the mathematical modeling of graph theory of a number of important model solution. Shortest Path, including the two methods, and the weighted Solution
Date : 2008-10-13 Size : 3.81kb User : 王清
[Other] tulusuanfa DL : 0: 这是一个图论的算法程序,是关于求关节点的程序,经过调试完全好用.-This is a graph algorithm procedure is a key point on the request procedures are followed, debugging completely handy.
Date : 2008-10-13 Size : 3.13kb User : 下沙
[Other] jacobianmatrix DL : 0: he power method will be applied to the jacobian matrix of the 2-D henon map to approximate the first Lyapunov exponent by creating a graph of ln|yn| vs. n, where n is the number of iterations of the power method and yn = 1/n*ln|DG^n(xo)*yo|. The slope will be an approximation to the largest Lyapunov exponent.-he power method will be applied to the jacob ian matrix of the 2-D map to approximate henon th e first Lyapunov exponent by creating a graph of ln | yn | vs. n, where n is the number of iterations of the power m ethod and yn = a / n * ln | DG ^ n (xo) * yo |. The slope w ill be an approximation to the largest Lyapunov exponent.
Date : 2008-10-13 Size : 1.39kb User : 杨蒙
[Other] chengshi DL : 0: 这个是我设计的城市交通无向图程序，里面的地点、距离已经给定（当然可以修改），运行时输入起点和终点即可。-this is my design of urban traffic undirected graph procedures inside the location, distance has been given (of course can be revised), running importation will be starting and finishing points.
Date : 2008-10-13 Size : 10.16kb User : 陈慧
[Other] minimalspaningtree DL : 0: 生成最小生成树的源代码,对数据结构中图论处理有帮助,有兴趣可以下-minimum spanning tree generation of source code, the data structure graph theory to help deal with are interested can make
Date : 2008-10-13 Size : 1.68kb User : 吕明洲
[Other] MTSP DL : 0: 解决多商旅问题的一个源程序,对图论的处理比较有借借鉴意义-solve problems and countless more a source of graph theory can be used in handling more Significance
Date : 2008-10-13 Size : 1.43kb User : 吕明洲
[Other] 04081302 DL : 0: 本程序实现了集合与图论中集合的有关操作交，并，补等，还有实现了各种闭包的求解。-the program with a set of graph theory involvement in the operation of pay, and make up. have achieved the closure of various solution.
Date : 2008-10-13 Size : 58.79kb User : 赵赵
[Other] Graph DL : 0: 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。
Date : 2008-10-13 Size : 3.34kb User : 彭立勋
[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.
Date : 2008-10-13 Size : 10.01kb User : 南亮亮
[Other] Graph DL : 0: 图表统计的一个类，能够做出各种个样的图形。
Date : 2008-10-13 Size : 30.35kb User : 韩丽烽
[Other] assignment5 DL : 0: maximum number of nodes in the graph graph with numNodes nodes and all nodes connected
Date : 2008-10-13 Size : 1.59kb User : zhang wei
[Other] graph DL : 0: 图的应用-铁路最短路径的源码以及实验报告！
Date : 2008-10-13 Size : 111.92kb User : iamrobot
[Other] 求最小Hamilton回路 DL : 0: 求最小Hamilton回路功能:在n个顶点的带权图G中，一条Hamilton回路是一顶点序列v1，v2，• • • • vn 其中，每个顶点vi由一条边连到vi+1（i=1，2，• • • • • ，n-1），而vn被连到v1。在所有的Hamilton回路中，寻找一条权值和最小的回路，这条回路就是最小Hamilton回路-circuit for the smallest functional Hamilton : n vertices with the right graph G, a Hamilton Circuit is a sequence of vertices v1, v2, # 8226 # 8226 # 8226 # 8226 T. which each vertex vi even from one side to a vi (i = 1,2, # 8226 # 8226 # 8226 # 8226 # 8226, n-1), which was connected to the T. v1. All the Hamilton circuit, finding a value and the right to the smallest circuit, this circuit is the smallest HamiltonianCycle
Date : 2008-10-13 Size : 42.9kb User : 吴剑刚
[Other] graph-cut background subtraction DL : 0: 基于graph-cut的背景减除算法。.....
Date : 2010-06-10 Size : 617.86kb User : dsszcp
[Other] Coursera Graph Theory Solutions DL : 0: Coursera Graph Theory Course .. assignments' solutions to pass the course in cplus plus
Date : 2017-11-24 Size : 8.38kb User : sigsegv22

« 12 »