BFS

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

关于随机发牌算法的小程序，作为数据结构的大作业，开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)

主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)

C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)

数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)

1>实现可以随意浏览任一景点的介绍。（功能一） 2>可以给出任意两个景点的最短距离及其路线。（功能二） 3>可以查看任一景点热度，并可以对对所有景点热度（访问次数）进行排序。（功能三） 4>每个景点相关内容从文件读取，实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)