搜索资源列表
12
- 此程序从国外网站收集得到,是标准的深度优先搜索算法,可实现节点遍历和检测回路的功能,详细情况请看原英文注释 我在此程序中添加了随机性,即遇到分叉时,随机选下一个节点,成为随机深度优先搜索算法-This procedure has been collected from the foreign website, the standard depth-first search algorithm, can be achieved and the detection circuit node t
DFS
- 标准的深度优先搜索算法,可实现节点遍历、产生随机路由、检测图中是否有回路等功能,-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计,包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
matlabsuanfa
- 包含了Floyd算法、dijkstra算法、贪婪算法、遗传算法、搜索算法、蚁群算法、哈密顿环路的matlab源程序及相关说明。-Floyd algorithm is included, dijkstra algorithm, greedy algorithm, genetic algorithm, search algorithm, ant colony algorithm, Hamiltonian loop matlab source code and instructions.
BFS
- 广度优先搜索算法分析;供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
searching
- 这是2个关于搜索算法的实现,为深度优先搜索和宽度优先搜索。希望大家喜欢!-This is a 2 on the implementation of search algorithms for the depth-first search and breadth-first search. Hope everyone likes!
dist
- 用编程语言实现八数码难题的启发式搜索算法; 2. 利用所编程的程序,对初始的So状态 用编程语言实现八数码难题的启发式搜索算法; 2. 利用所编程的程序,对初始的So状态 -用编程语言实现八数码难题的启发式搜索算法; 2. 利用所编程的程序,对初始的So状态
fbsc
- 禁忌搜索算法C/C++源代码,比较经典的算法。初学者可以看看 -Tabu search algorithm C/C++ source code, compare the classic algorithms. Beginners can look at the
Alphabeta_HH
- Alpha-Beta搜索算法,博弈树搜索中最常用的算法之一-Alpha-Beta search algorithm, the game tree search, one of the most commonly used algorithms
Search_matrix_based_on_the_adaptive_anti_collision
- 提出一种基于搜索矩阵的自适应防碰撞算法.该算法有效利用碰撞信息,通过构造搜索矩阵,克服自适应 二又树搜索算法逐位搜索效率低的缺点.同时提出碰撞堆栈的概念,根据时隙状态,来自适应调整搜索路径,从而 减少碰撞和空闲时隙数以及传输的比特量.理论和仿真实验表明,该算法有效实用,可有效减少识别时间,提高搜 索效率-Presents a matrix of adaptive search-based anti-collision algorithm. The algorithm is the e
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.
tabu_matlab
- 采用禁忌搜索算法和模拟退火法来求解旅行商问题,PDF文件,说明很详细-Using tabu search algorithm and simulated annealing method to solve the traveling salesman problem, PDF document describing in great detail
The_Intelligent_Optimization_Methods
- 有关智能优化方法(模拟退火,遗传算法,禁忌搜索,等等)-The intelligent optimization methods (simulated annealing,genetic algorithm,tabu search,etc)
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
tspmatlab
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
sfsf
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
sousuo
- 用有序链表编写的搜索算法,数据结构课用,可以参考-pointer
Three_Step_Search
- 三步搜索算法是原始的比较经典的块搜索法,是块运动中比较常用且算法简单的搜索方法-Three-step search algorithm is a comparison of the original classic block search method is to block movement of the more common and simple algorithm search method
method1
- 讲述现代优化算法中的禁忌搜索算法,及其应用,时运筹与优化课程的提高。-About the modern optimization algorithms in the tabu search algorithm, its application, when the improvement of logistics and optimization programs.
2fen
- 设a[1:n]是已经排好序的数组。该二分搜索算法,使得当搜索元素x不在数组中时,返回小于x的最大元素位置和大于x的最小元素位置j .当搜索元素在数组中时,i和j相同,均为x在数组中的位置。-Set a [1: n] is already sorted array. Please rewrite the binary search algorithm, so when the search for element x is not in the array, the return is less