最小生成树的prim算法
是求图中的最短路径的一个重要算法
但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
BerkeleyDB,非常有名的开源嵌入式数据库系统,含完整安装包、文档和源码-BerkeleyDB, very famous revenue Embedded database system with a complete installation package, documentation and source code
由于计算机存储的限制,当其所存储的数大于32位时,就会有溢出,该程序只要是实现大数加法 减法 乘法。-computer storage limitations, when it stored more than 32 a few hours, there will be a spillover, The procedure is as long as the majority addition subtraction multiplication.
可以过来看看有关8皇后的相关算法.这是本人初学数据结构运用堆栈编写的小程序-can come look at the Statue of eight correlation algorithm. This is my beginner stack data structure prepared by the use of small programs