搜索资源列表
Kruskal
- kruskal算法，实现图的遍历最短路径查找，本人的算法设计的一次实验。-Kruskal algorithm, to achieve the shortest path graph traversal search, the algorithm I designed an experiment.
NoDirectG
- 无向图的双向连通，java语言实现。功能不错。希望喜欢。-Undirected graph of two-way connectivity, java language. Function well. I hope like.
shortestway
- 数据结构最短路径算法实现，可实现有向图，无向图，有向网，无向网四种最短路径求解，最后打印路径，和路径长度-Data structure to achieve the shortest path algorithm can be realized digraph, undirected graph, to the network, without the four shortest path to the network to solve
graph
- (1).用Bresenham算法绘制直线. (2).用Bresenham算法画图. (3).用打点(如:C语言的putpixel())法显示汉字,汉字库以文件形式保存,以图形方式显示汉字. (4).在二维空间绘制一个多边形(三角形,四边形任选),然后实施平移变换,对称变换和旋转变换,-(1). Bresenham algorithm for drawing a straight line to use. (2). By dr
svdthesis.pdf
- GRAPH CLUSTERING by FLOW SIMULATION.pdf
FibonacciHeap
- FibonacciHeap是一种优先队列，就平均而言有很好的性能，所以在一些图论算法中可以用来作改进算法的数据结构，尤其是那些稀疏图，总之是很好的工具。下面以设计者的角度简单描述我设计它的过程和思路。-FibonacciHeap is a priority queue, on average, have a good performance, so in a number of graph theory algorithms can b
graphprogramming
- 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, f
graph
- 图的广度优先遍历和深度优先遍历,C语言程序 -Graph breadth-first traversal and depth-first traversal, C Programming Language
AILab_3
- 使用Java实现的Graph的迭代加深的深度优先搜索-Graph using Java to achieve iterative deepening depth-first search
tu
- 图的建立，图的广度优先遍历，深度优先遍历，邻接表等，c语言-Chart the establishment of the breadth-first graph traversal, depth-first traversal, such as adjacency list, c language
graph
- 数据结构中图的设计。这是图的邻接矩阵的存储结构。-Data structure design. This is the graph adjacency matrix of the storage structure.
metre.tar
- 这是一个C程序分析工具，它可以对C程序的最大调用深度等定量指数进行度量，还可以输出调用图。-This is a C program analysis tools, it can call C procedures greatest depth quantitative index measurement, can also call graph output.
graph
- 对图的深度优先遍历 基于堆栈 非堆栈 两种实现-On the graph depth-first traversal of non-stack based on the stack of two to achieve
stream
- 网络流算法 涉及：数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
Graph_Cut
- Graph Cutshi是最近在计算机视觉中研究和应用比较多的优化算法，典型的用于stereo matching, image restortion, texture synthesis等应用，以上代码给出了graph cut，mean shift, 以及相关的ppm/pgm图像借口，本来是用于stereo matching的，已经把相关的matching的实现代码给去掉了。大家可以以此为平台做一些相关的研究和应用。 -Graph Cu
ModifySpace
- 根据分块图像的均值与标准差将图像表示成三种状态：边缘态、平坦态、纹理态。然后计算状态关联图，提取出图像的空间特征。可用于图像检索。 -Under the sub-block images of the mean and standard deviation images express into three states: the edge of state, the flat state, texture state. And t
An_Experimental_Comparison_of_maxflow_aigorithm.ra
- 是基于Graph cuts 的源程序，用来求解Min-Cut/Max-Flow.-Graph cuts based on the source code for solving Min-Cut/Max-Flow.
maxflow_fast_approximate_energy_minimization_via_g
- 如何利用Graph cuts 快速逼近最小化能量。-How to use Graph cuts fast approaching the minimum energy.
Phase_unrapping_using_Graph_cuts
- 用Graph cuts 来解决磁共振图像的 phase unwrapping。-Graph cuts used to solve the magnetic resonance images of the phase unwrapping.
maxflow_fast2
- Software for energy minimization with graph cuts。-Software for energy minimization with graph cuts.