Six-degree-space

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)

实现链表的一些操作，方便进行遍历，查找等程序(Operation, convenient linked list traversal, the search procedure)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

说明：  a set of uestc computer academic matu

希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)

用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)

无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

魔王语言：输入一串字符，可自动翻译成一串语言。(the program of language)