搜索资源列表
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
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
Non-recursive-
- 无向图的先序和中序后序的递归和非递归算法-Non-recursive algorithm recursive undirected graph
Prim
- prim算法，用c++程序实现,可以解决图论的最小生成树问题-prim algorithm which can solove the graph theory with c++
zuiduanlujin
- 最短路径。最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和边组成的）中两结点之间的最短路径。-The shortest path. The shortest path problem in graph theory is a classical algorithm issue, aimed at finding the shortest path diagram Two nodes (the nodes and edges) is between.
hungarian-algorithm
- 用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm
liziqundaima
- 使用粒子群算法实现系统辨识中参数的辨识，得到相应的图形。-Particle swarm optimization algorithm is used to realize the identification of parameters in system identification and get the corresponding graph.