yongzhanshixianleicaozuo

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

迪特斯特拉算法，课程设计的作品，主要计算站点距离的吧，可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)

计算机博弈大赛不围棋的代码 个人所写，可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)

　广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)

8_queen问题的一个自创的算法，还不错！(8_queen)

长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)

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

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)