数据结构堆栈之后缀表达式求值

对于小型图书销售书店而言此软件具有图书销售管理功能，可大大减轻Boss的工作量及帐目清算工作。也对这方面软件开发者有参考价值。-book sales for small bookstores run the software with book sales management functions. Boss can greatly reduce the workload and accounts for liquidation. Also in this area software developers have reference value.

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

一个经典的数据结构的实现-a classic of the data structure to achieve

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

改进的矩阵操作类,增加了诸如对矩阵任意行/列的存取,矩阵的积分图像的计算等-improved matrix operations, such as the right to increase the matrix arbitrary line/column access, image matrix of the integral calculation

严蔚敏编写的《数据结构》第2章的答案，全部为源码-the answers of chapter two of a book called ‘Data Structures’ writen by Yan Wei Min

用c实现的判断一个图是否有环，数据结构中的经典算法，输入一个图，然后判断是否有环。-used to achieve a judgment whether there are plans in Central and data structure of classical algorithm, the importation of a map, and then determine whether there is any ring.

数据结构链表 创建链表，删除元素，插入元素，查找元素，检查给定的插入位置的正确性，节点移动，单链表-Create a linked list data structure linked list, deleting elements, inserting elements, find elements, check to set the location of the correctness of insertion, node movement, a single list

Oracle BerkeleyDB--SQLitehttp--www_sqlite_com_cn-_files2.rar//bdb2

用迪杰斯特拉算法求解最短路径问题，这个算法是我自己编出来的 ，感觉有很多冗余之处，请大家一起改正-Using Dijkstra shortest path algorithm, this algorithm is out of my own, I feel a lot of redundancy, please everyone together to correct