搜索资源列表
二分法.rar
- 一个二分法查找的图形演示程序, A dichotomy search graph demonstration program
An-Efficient-Method-of-Texture-Synthesis-Based-on-
- 提出一种带边界匹配的基于 Graph Cut 的快速纹理合成算法.通过将纹理样本以不同的位移贴到输出图中完成合成 ,重叠区域的像素取值由 Graph Cut 确定.引入边界图辅助位移搜索 ,以增强合成结果的边界连续性 在预处理过程中计算 2 个相同样本在所有相对位移下的匹配误差 ,选取一部分误差最小的位移组成 “优选位移” 集合 ,合成过程中的块间相对位移仅从此集合中选取 ,大大地提高了合成速度.-This paper proposes an efficient method for tex
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.
Image_Paper_XuXG
- 用Snake算法和基于动态规划的图搜索算法，有效地实现了复杂物体轮廓特征的提取。 -With the Snake algorithm and based on dynamic programming graph search algorithm, effective implementation of the complex features of an object contour extraction.
dijkstra
- Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing.
puzzle
- 请设计算法，使用至多4种不同颜色对七巧板进行涂色（每块涂一种颜色），要求相邻区域的颜色互不相同，打印输出所有可能的方案。 提示：可以把七巧板上的每个区域看成一个顶点，若两个区域相邻，则相应的顶点间用一条边相连，这样将七巧板转换为图，该问题实质上是一个图的搜索问题。 -Please design algorithm, using up to 4 different colors for coloring on the puzzle (each block of color coated),
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
PSO-image-segmentation-algorithm
- 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and
Tabu--search--for--graph-
- 用禁忌搜索方法求解图分割问题，大师级人物Fred Glover写的文章，是禁忌搜索的一个典型应用。里面给出了禁忌搜索的流程，算例的结果是与Simulated annealing和Kernighan-Lin s heuristic两种方法进行比较-develop a tabu search procedure for solving the uniform graph partitioning problem
Graph11
- 用C++实现了基于图的深度搜索算法。包括图的初始化、图的输入、图的深度搜素及搜索结果输出等。-Depth map-based search algorithm in C++. Including initialization, input to the graph of the Figure, the depth of the graph search and search results output.
matlab
- 图论中经常用到的深度优先搜索法 经常用在电力系统的可靠性的解列运算当中-Depth-first search method often used in graph theory is often used in the reliability of the power system splitting operator which
6.7.1
- 图的深度和广度优先搜索1.图采用邻接表的存储结构2.深度优先搜索图3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
CBIR
- 基于内容的图像检索，用C++实现以图搜图的功能。-Content-based image retrieval, using C++ to achieve a map search function graph.
GraphParser
- Graph Parser For Breadth First Search
DepthFirstSearch
- Depth First Search For Graph
BFS
- bfbreadth first search methode for graph theory
Graphics-A-STAR-algorithm-master
- A星寻路算法，实现图形中路径的搜索和规划最短路径的功能。-A star pathfinding algorithm, search functions and planning the shortest path in the graph path.
模板匹配
- 模板匹配用来在一副大图中搜寻查找模板图像位置的方法(Template matching is used to search for a method of searching the location of template images in a large graph)