搜索资源列表
BoxDual
- 是一个有自动求解功能的推箱子游戏，本人的旧作品。使用了从起点和终点两个方向同时进行有向图搜索的方法，是学习博弈算法的极佳参考。闲来玩玩这个游戏可锻炼思维，精选了网上流行的很多高难度地图，如果全部都可不使用AI求解，那就很厉害了。-is an automatic function of viewing solving games, my old works. Use the starting and finishing points from two directions simultaneous
C
- 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorit
SemanticPhotoSynthesis
- We propose a technique that allows a person to design a new photograph with substantially less effort. This paper presents a method that generates a composite image when a user types in nouns, such as “boat” and “sand.” The artist can optionally
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
An-Efficient-Method-of-Texture-Synthesis-Based-on-
- 提出一种带边界匹配的基于 Graph Cut 的快速纹理合成算法.通过将纹理样本以不同的位移贴到输出图中完成合成 ,重叠区域的像素取值由 Graph Cut 确定.引入边界图辅助位移搜索 ,以增强合成结果的边界连续性 在预处理过程中计算 2 个相同样本在所有相对位移下的匹配误差 ,选取一部分误差最小的位移组成 “优选位移” 集合 ,合成过程中的块间相对位移仅从此集合中选取 ,大大地提高了合成速度.-This paper proposes an efficient method for tex
Arithmetic
- 图论小程序,一个经典算法，需要相应算法的直接替换部分内容就可以了。-graph search
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
Graph
- c写的贪心算法，利用指针来搜索最短路径，以及可以扩展成一般最短路径的求法-c write greedy algorithm, using a pointer to search for the shortest path, as well as the shortest path can be extended into a general law of demand
dijkstra
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path
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.
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.
visibility_graph_robot_motion
- visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
graph-search-algorithm
- 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及 其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points.
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
graph
- 图的非递归深度优先遍历，建图是以邻接表为基础的-graph search
graph-lib-search
- Geocoding and reverse geocoding utilities for Java Open Graph search.
graph-search-algorithm
- 本算法是基于图论的广度优先搜索算法，对于配电网的孤岛搜索，以及各个孤岛的电气连通性判别具有很好的效果。-Used to solve the problem about graph search algorithm.