搜索资源列表
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
Simple_MinCut
- Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact descr iption, is easy to implement, and has a surprisingly simple proof of correctness.
MessageBox
- The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
dijkstra
- Dijktra s single source shortest path algorithm. The function takes a graph (which may be sparse) as an input and returns the matrix of shortest distances between all of the nodes. Additionally, individual source and sink nodes may be specified as ad
43
- 连通图算法程序，研究这方面的人可以参考一下-Connected graph algorithm program, research in this area can refer to
algorithm
- 图论的算法与程序设计，广大程序员进阶必究！-Graph theory, algorithms and program design, the majority of programmers advanced reserved!
Graph
- 用C++实现的图论的一些程序，还很实用。包括了：搜索树等一系列算法-C++, graph theory to achieve some of the procedures, still useful. Includes: a series of search tree algorithm
weimianfenge
- 一种改进的图象分割程序,分割出来效果相当好,尤其对于丰富的图象,保证别人没有上传过-Based on graph cut image segmentation algorithm, split the result was very good, especially for texture-rich images, ensure that no one else uploaded
coloring_graph
- Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.
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
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法，代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
Primukas.java.tar
- In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
yiqun
- 蚁群算法是一种用来在图中寻找优化路径的机率型技术，该算法具有许多优良的性质，具有一种新的模拟进化优化方法的有效性和应用价值， 是一种求解组合最优化问题的新型通用启发式方法，可以解决一维静态优化问题甚至多维动态组合优化问题。 -Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many goo
1112333
- 量子遗传算法应用于物理频谱分析，结果表明基于量子遗传算法的频谱分配算法性能明显优于颜色敏感图论着色算法-Quantum genetic algorithm is applied to the physical spectrum analysis, the results show that genetic algorithm based on quantum of spectrum allocation algorithm is superior to color-sensitive color
Basedonthecognitivenetworkofgraphcoloringmodelofth
- 本文研究了认知网络中基于图论着色模型的频谱分配算法。-This paper studies the cognitive network model based on graph theory spectrum allocation algorithm for coloring.
1
- Java for graph algorithm such as testing planarity graph
graphes-algorithmes
- Algorithm of Graph -Algorithm of Graph ...........................
ostu_matlab
- Otsu算法是图像分割算法中比较实用和高效的一种，对图像的后续处理有很好的作用-Otsu algorithm is image segmentation algorithm in a more practical and efficient, the follow-up processing of the images have a good effect
tutorial_on_spectral_clustering
- In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algo
Multistagegraph
- 多段图的算法，用C++写的，完全没有问题-Multi-stage graph algorithm, written using C++, no problem