sparse matrix algorithm Cross Chain

数据结构的课程设计---稀疏矩阵运算器 希望可以给大家参考-data structure design of the curriculum-- for sparse matrix operations can hope for your reference

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

《数据库系统实现》前四章，数据库实现的经典书，介绍了很多原理性的东西。-" Database system implementation," the first four chapters, the database to achieve a classic book describes the principles of a lot of things.

一个商业软件的源码，含数据库，图形等多种操作-A source of commercial software, including databases, graphics and other operating

Thalmann算法的java实现。有详细注释。-Thalmann algorithm to achieve the java. Notes detail.

重写了微软提供SQLHelper(共用的数据库调用接口） 1把SqlHelper的connectionString做成一个全局量，统一设置数据库连接字符串 2增加了返回特定表名的DataSet的各接口。 可在项目的config文件设置数据库连接字符串 private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings["ConnectionString"] 当然可以把数据库连接方法修改后直接用。-rewritten Microsoft SQLHelper (shared database Call Interface) a SqlHelper the connectionString caused an overall volume, uniform database connections increased by two strings to the specific name of the table in the DataSet interface. In the config files set database connection string private static string connectionString = System.Configuration.ConfigurationSettings.AppSettings [ "ConnectionString"] lt; !-- Application specific settings-- gt; Lt; AppSettingsgt; Lt; Add key

一个效率还可以的配对堆 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 structures: The linked list storage structure seeking to do two one dollar sum of the results of polynomial

最新收集得老外写的一个矩阵类，功能相当的强大，比以前的源码水平提高了不少，源码中有相当详细的英文注释，简单明了！-collected in the latest foreigner to write a matrix of type, quite powerful, the source than the level a lot, a significant source of detailed notes in English, simple!

本书主要介绍Delphi的数据库编程知识，为Delphi开发人员提供了很好的指导。-This book introduces the Delphi programming knowledge database for Delphi developers have provided a good guide.