Mult

校园导航问题，设计你的学校的平面图，至少包括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.)

用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)

关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)