yinhangjiasuanfa

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

校园导航系统 1） 校园景点介：绍介相关景点的有关详细信息。 2） 最佳路线查询：查询校园中任意两点之间所有路线，并提供两点间最短的简单路径。 3） 关节点查询：提供校园图的关节点查询。 4） 多景点最佳路线查询：提供多个景点的最佳线路查询，即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)

上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)

北大ACM1702题 转换为3进制 很经典(NULL)

数据结构的一些简单的排序算法，有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)

用模板实现了单向链表的增删改查等功能，并且适用于多种数据结构和类，简单实用，是学习和使用的绝好资料(Template to achieve a one-way linked list CRUD functions, and is suitable for a variety of data structures and classes, simple and practical, is to learn and use excellent information)

利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)

插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)

说明：  数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)