shu

演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )

一个苹果走迷宫，支持最短路径寻路。可以使用方向键操作，也可以用户自己添加迷宫格式文件，生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)

已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)

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

说明：  在给定的字母中，用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)

图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)

二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)