Work3.5

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

图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书(yrteryryer)

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

C数据结构常用算法程序集５，描述数据结构算法。(C data structures commonly used algorithm suite 5, describe data structure algorithms.)

数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)

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

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

说明：  拓扑排序 　 对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任 意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。 　 通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。 注意： 　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。 　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。 　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

有理数的算法，包括其加减乘除，启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)