1,图的建立与遍历操作
建立图的邻接矩阵
输出图从顶点V0出发按深度优先遍历的顶点序列
输出图从顶点V0出发按广度优先遍历的顶点序列
2,图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting
求最大公约数和最小公倍数的程序,输入两个数,能求出最大公约数和最小公倍数-seek common denominator and implements procedures to import two few, the common denominator can be obtained and implements
实现了临时建立分区和永久建立分区的效果
可以压缩和解压缩的解压缩文件-achieve the establishment of the provisional district and the establishment of a permanent regional results can be compression of the extracted files
一个可以应用的案例,但是数据库操作不复杂。其中全面地涵盖了所有常用数据库操作。-1 can be applied to the case, but the database operations are not complicated. Which comprehensively covers all common database operations.