poj1125 binary heap using the Dijkstra algorithm optimization

线性表的顺序逻辑结构的实现，线性表作为数据结构中的较为简单的结构，但对它实现的理解是进一步学习的关键．-the implementation of liner table is the most basic and simple structure in data stucture,but it is the best way to learn other data structures.

用c写的数据结构问题-Construction of data question writes which with c

钱能C++习题答案-money can answer the questions

通信录- The correspondence records

树的数据结构源代码-tree data structure source code

用C语言实现的各种算法及演示，可以结合代码分步观看执行过程-C language algorithms and the various presentations, combining code can watch the step-by-step implementation process

学生信息建立   // 上机实验二.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include "iostream.h" #include "string.h" struct Student {        char id[10];        char name[10];        char sex[10];        char grade[10];        char tel[10];        int age; };

0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem

此程序为求两个数的约数,将他们输出,将这两个数的最大公约数输出 -procedure for the sake of a few two about a few of their exports, the number of these two majors output

这是用链表实现的栈数据结构。链表数据结构的最大优点是不受元素个数的限制，除非内存耗尽。-This is the stack implementation with linked list data structure. List data structure is not subject to the greatest advantage of the restricted number of elements, unless the memory run out.