先输入矩阵的维数，再输入该矩阵，然后通过该算法从大到小输出该矩阵的各行各列和主辅对角线的和...

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

是数据结构中经常见到的矩阵运算，包括＋,-,* 。-data structure is often seen matrix operations, including+,-,*.

适合用来做K_Means 和K_NN的数据，一共150组，分成3个簇。-K_Means and make suitable for K_NN data, a total of 150 groups, divided into three clusters.

SQLite源代码！ SQLite源代码！-SQLite source code! SQLite source code! SQLite source code!

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

数据结构的课后练习-Data structure of the after-school practice

一个用C++实现的B+tree程序源代码-b+tree implemented with c++

重言式是当所有逻辑变元取遍所有值时都为真的表达式。这个程序是用来对重言式进行判别的！还可以吧！牛人别见笑！-tautology is when all logic variables take out all values are true expressions. The procedure is used to tautology runs! Also! Other cattle were laughed at!

选择AL2格式文件，修改代码可以插入txt文件等等，解析文件赋值实体，格式固定，转而插入ORACLE数据库记录

最小生成树的解决方法，可以通过输入权值，定点，重点解决问题-Minimum spanning tree solution, can enter the right value, fixed-point, focusing on problem-solving