搜索资源列表
MySeg
- 最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstra algorithm derived from the s
haokan
- 试扩充深度优先搜索算法，在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中，指针t指向生成森林上具有图顶点v信息的根结点。（提示：在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前，建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。） -try to expand the depth-fir
tulusuanfa
- 这是一个图论的算法程序,是关于求关节点的程序,经过调试完全好用.-This is a graph algorithm procedure is a key point on the request procedures are followed, debugging completely handy.
qubushu
- 图论程序全部树算法可算出任一个图的全部树-graph theory all the procedures tree algorithm can be considered as a map of all tree
用C实现的bfs源程序
- 图论算法中必学的内容之一,希望能给学习编程的学弟学妹们有所帮助-graph algorithm will learn one of the elements in hopes of giving the incoming young men and women to learn programming help
Graph-Drawing-by-Force-directed
- 这是关于force-direct算法的可视化方向的论文，主要为了使得画布中的各点分布均匀，弹簧与戒指模型说得很不错。-This is about the force-direct visualization of the algorithm the direction of the paper, the main canvas in order to make the points evenly distributed spring model very well with the ring.
random_walker_matlab_code
- The random walker algorithm was introduced in the paper: Leo Grady and Gareth Funka-Lea, "Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials", in Proceedings of the 8th ECCV04, Workshop on Compute
suanfa
- 实现识别标识符的状态转换图算法。掌握识别标识符的状态转换图的理论知识和算法实现。-Identifier to achieve recognition of the state transition map algorithm. Master identifier to identify the state transition graph theoretical knowledge and algorithms to achieve.
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorith
PrimsAlgorithm
- 图论Prime算法Matlab源代码,来源www.matlabsky.cn-Prime graph theory algorithm Matlab source code, source www.matlabsky.cn
43
- 连通图算法程序，研究这方面的人可以参考一下-Connected graph algorithm program, research in this area can refer to
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
C
- 主要介绍线性结构,树型结构,图状结构三种逻辑结构元素的存储实现,在此基础上介绍一些典型算法及时,空效率分析.-Introduces the linear structure, tree structure, graph-like structure of three elements of the logical structure of the storage to achieve, on this basis are some typical algorithms in time, spac
08_DP
- 严蔚敏数据结构算法实现 其中对树，图论算法进行了C++实现-Yan Wei-Min algorithm data structure in which the tree, graph theory, algorithm C++ Implementation
NiceChart
- Once I need a chart component that can shows interpolated lines for one of my project. I don t need a sophisticated full-featured chart, I just need a simple one with basic functionalities. Don t find a way to do it with standard Delphi TChart compon
DYNAMIK-COLORING
- Dynamic graph coloring algorithm
xyl_suanfa
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the core of the algorithm is to fi
ant
- 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-The ant colony algorithm (ant colony optimization, ACO), also known as ant algorithm the the probability type algorithm is a method for finding the optimal path in the graph.
Non-recursive-
- 无向图的先序和中序后序的递归和非递归算法-Non-recursive algorithm recursive undirected graph
hungarian-algorithm
- 用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm