搜索资源列表
GA
- 利用遗传算法所设计的随机产生地图之推箱子小程序 可参阅内容之Fitness以及基因的变异和交配 -Using genetic algorithms designed randomly generated map of Sokoban program can refer Fitness content and gene mutation and mating
111
- 简单比值算法的差异图构造，先过滤，后比值。-Simple ratio of the difference map algorithm
ChinaMapShift
- 百度、谷歌等地图坐标纠偏算法，实现由WGS84转换为CJ-02火星坐标系-Baidu and Google map coordinates correction algorithm
TraveseMap
- 用深度优先搜索和广度优先搜索算法遍历一个图-travel map by DFS and BFS algrithm
Sparse-Coding
- 解决MAP问题的全新算法，是SCI二区的一篇文章，希望对大家有所帮助。-The new MAP algorithm to solve the problem is an article SCI Second District, we want to help.
jk
- 图的连通性判断。本次实验要求用计算机语言编写图的连通性判断算法，可输入图的邻接矩阵，判断图是否连通以及确定连通分支的个数，使学生掌握Warshell算法或矩阵幂算法的实现方法，培养算法设计与优化能力。-The experiment requires written in a computer language to determine the connectivity graph algorithms, you can enter the adjacency matrix to determin
bayes
- 基于贝叶斯算法的数字图图像抠图，在matlab下实现其运行，图像保存在目录为e盘-Based on bayesian algorithm of digital map image cutout, achieve its operation under matlab, to e disk images stored in the directory
ColorTheMap
- 回溯法实现美国地图着色，可选择州数，颜色数，算法还不完善，时间复杂度较高，望高手改进-Backtracking to achieve the American map coloring, optional state number, number of colors, the algorithm is not perfect, the time complexity is high, experts hope to improve
Dialog
- 迷宫游戏，实现自我绘制地图，算法回溯法与A*算法。-Maze game, to achieve self-drawn map, backtracking algorithms and A* algorithm
2006
- 国家集训队2006论文集 陈启峰：《“约制、放宽”方法在解题中的应用》 陈首元：《维护森林连通性——动态树》 冯威：《数与图的完美结合——浅析差分约束系统》 高逸涵：《对于一道题目的深入分析》 胡伟栋：《演讲的若干建议》 黄劲松：《贪婪的动态规划》 黄晓愉：《深度优先搜索问题的优化技巧》 贾由：《由图论算法浅析算法优化》 李天翼：《从特殊情况考虑》 龙凡：《一类猜数问题的研究》 汤泽：《浅析队列在一类单调性问题中的应用》 唐文斌：《“调整”
ACO_TSP
- 研究蚁群算法的经典论文和解决TSP问题的源程序。绘制最短路径图和收敛图。-classic papers and problem solving TSP source program. Draw the shortest path map and convergence graph.
Dijkstras-algorithm
- 基于OpenGL的动态Dijkstra算法最短路演示程序，给定一张图文件，能动态的展示Dijkstra算法求得最短路的过程。-OpenGL-based dynamic Dijkstra shortest path algorithm demo program, given a map file, Dijkstra s algorithm can dynamically show the process to obtain the most shorted.
Dijkstra
- 算法作业,迪杰斯特拉算法vs2008+opencv实现,任意构造有向图并计算图上任意两点最短路径及其长度-Arithmetic operations, Dijkstra algorithm using vs2008 and opencv , arbitrary construct a directed graph and calculate the shortest path between any two points on the map and its length
MyGA_CPP
- 使用MFC写的遗传算法的例子，使用DC做图，可以很直观的看出变化。-The use of genetic algorithm written in MFC example, the use of DC map, you can see the changes in a very intuitive.
LIANTONGXING
- 通信网实验通过warshall和矩阵幂算法判断图的连通性，运用图的遍历方法计算图的连通分支数-The number of branches connected communication network experiment warshall and matrix power algorithm to determine the connectivity graph, use graph traversal methods of calculation map
A
- 在C++下进行地图的最短路径搜索的A*算法这个算法被广泛应用在即时游戏的路径寻找过程上。-In the C++ under the map of the A* shortest path search algorithm for this algorithm is widely used in real-time search process on the path of the game.
FLOYD
- 利用MATLAB 实现Floyd 算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。 用MATLAB 仿真工具实现Floyd 算法：给定图G 及其边(i , j )的权 wi , j (1≤i≤n ,1≤j≤n) ，求出其各个端点之间的最小距离以及路由。 -Floyd achieved using MATLAB algorithms for the shortest distance routing adjacency matri
Astar
- A-Star算法是一种静态路网中求解最短路最有，是matlab程序，可以运行实现，有网格图可以观测结果。-A-Star is a static algorithm for solving the shortest road network in most, is matlab program, you can run to achieve, there is a grid map can be observed results.
Lvwatershed
- 本程序利用opencv开源库实现watershed算法，利用人工选择种子点与梯度图两种方法来获取种子点。压缩包内有word文档介绍具体的操作和示例。-The program uses the open-source opencv library implements watershed algorithm, using artificial selection gradient map seeds and seed are two ways to get points. Compressed p
SOM-PNN
- 本文将SOM（自组织特征映射）和PNN（概率）神经网络应用到柴油机故障诊断中，首先介绍了SOM和PNN神经网络的算法，然后对柴油机的故障进行了分析，并运用matlab进行了仿真，验证了实验结果。-This article will SOM (self-organizing feature map) and PNN (probability) neural network is applied to fault diagnosis of diesel engine, first introduce