搜索资源列表
shiyan
- 使用Javascr ipt和Applet实现网页版的插入算法、归并算法、堆排序、快速排序、多项式加减(用链实现)、十进制转化为二进制(用队+栈实现)、开放地址法(线性探测)、一次探测法(平方探测)、二次探测法(双HASH)实现快速查找、利用二叉排序树进行排序与查找以及删除一个节点、实现宽度优先或深度优先排序算法、实现Kruskal算法或Prime算法-Insertion algorithm, merging algorithm, heap sort, quick sort, polynomial
ReArrayStyleBoxBoundedDepthSearch
- 使用有界深度优先搜索方法实现任意初始和终止状态的重排九宫格-Bounded depth-first search to achieve Style Box
myjiugong
- 九宫格算法(包括广度优先、深度优先、有界深度优先和A*)-Squared algorithm (including breadth-first, depth-first, bounded depth-first and A*)
BFSaDFS
- 基于java语言实现的树的深度优先搜索和广度优先搜索-Based on java language tree depth-first search and breadth-first search
DFS
- 有向图或者无向图的深度优先遍历,给出遍历的节点序列-DFS for the directed or undirected graph ,which returns the ordered vertex set
firstjava
- 通过java界面实现图的初始化,再利用图的深度优先找到从始点到终点权值最小的路径-Through the Java interface to figure initialization,Reuse the depth of the figure is from the beginning to the end point to find the path of least weights
n-queen
- 解决n皇后问题 利用回溯算法 n后问题等于在n×n格的棋盘上放置n个皇后,任何2个皇后不放在同一行或同一列或同一斜线上。即规定每一列放一个皇后,不会造成列上的冲突;当第i行被某个皇后占领后,则同一行上的所有空格都不能再放皇后,要把以i为下标的标记置为被占领状态。用回溯法解n后问题,用完全n叉树表示解空间。可行性约束Place剪去不满足行,列和斜线约束的子树。从根节点出发搜索解空间树。算法搜索至空间树的任何一结点时,先判断该点是否包含问题的解。如果肯定不包含,则跳过对以该结点为根的子树的搜索,
SourceSeek
- 深度优先遍历图结构,得到图的路径,可用于追踪-Depth-first traversal of the graph structure map path, can be used to track
deepwebCrawler
- 简单的多线程深度优先爬虫,将下载好的网页通过过滤HTML标签转换为TXT格式-a simple and parallel clawer
dujunnan_ddp_puzzle
- 九方块路径问题,采用深度优先的遍历方法对六层以下的深度进行遍历,如果路径深度小于6层,则输出其路径,如果大于六层,则说明。-Nine squares path problem, using the depth-first traversal method to traverse the depth under 6 layer, if the path is less than 6 layer depth, the output of its path, if more than six floo
dfs
- 基于java 实现的深度优先搜索(dfs),通过栈实现-deep-first search(dfs)
8-figure-puzzle
- 用深度优先搜索实现八数码问题,适合对java感兴趣的人作为一个有趣的练习-Depth-first Algorithm is used to implement the eight-figure puzzle, suitable for people interested in Java as a fun exercise
DS3
- 基本图算法的实现,包括深度优先搜索、广度优先搜索、最短路搜索-graph algorithm
eight-number-question
- 使用Java编写的用深度优先算法解决8数码问题的源码,八数码也叫九宫格问题,在使用算法前使用逆序数判断,自己写的,直接可以运行-Written in Java using depth-first algorithm source code, to solve the problem of 8 digital 8 digital also called scratchable latex, judge before using algorithm using reverse number, wri
8puzzlefinal
- 深度优先搜索解决任何八码图和十六码图 非常有用的代码-eight puzzle application
Sample_8_1
- 是一个游戏路径选择搜索的android demo,有广度优先和深度优先-Is a game android demo search path selection, there is a breadth-first and depth-first
DFS
- 深度优先算法实现 深度优先算法实现 深度优先算法实现-Depth-first algorithm depth-first algorithm depth-first algorithm depth-first algorithm
DS_2017_Assignment3
- 广度优先 深度优先源码 广度优先 深度优先源码-breadFirst depteFirst breadFirst depteFirst
MAZE_TEST
- 一个用java写的迷宫小程序,能自动生成迷宫,并使用深度优先和广度优先算法解迷宫(A small program written in java maze, can automatically generate mazes, and the use of depth first and breadth first algorithm to solve the maze)