资源列表
linjiejuzhen
- 大学数据结构上机作业，C++语言写的邻接矩阵，练习邻接矩阵的工作机制。-University of machine operation data structures, C++ language to write the adjacency matrix, adjacency matrix to practice the working mechanism.
shensouguangsou
- 大学数据结构上机作业，C++语言写的深度搜索和广度搜索，练习并理解两种搜索的原理。-University of machine operation data structures, C++ language to write the depth and breadth of search search, practice and understand the principles of two search.
beibaofenti
- 大学数据结构上机作业，C++语言写的0-1背包问题解析，练习并理解0-1背包的原理。-University of machine operation data structures, C++ language to write the 0-1 knapsack problem analysis, practice and understand the principles of the 0-1 knapsack.
ADA
- 简单介绍常用的数据结构，是初学者能更快入门，包括链表 数组 线性表-Brief commonly used data structures, beginners can quickly get started, including an array of linear table list
MPI_ug_in_FORTRAN.pdf
- This a manual for message passing interace for writing paralll program to run of supercomputers and is very easy to follow-This is a manual for message passing interace for writing paralll program to run of supercomputers and is very easy to follow
sequence-list-conversion
- 采用顺序堆栈实现十进制转换为二进制的C++程序源码-In a sequential stack to achieve a decimal is converted to binary c++ program source code
link-list-conversion
- 数据结构中采用链式存储堆栈实现数制之间的转换的c++完整源程序-In c++ language to achieve the data structure of system is realized by using chain stack conversion between
link-list
- C++语言实现的链式存储线性表的插入、删除、查找等操作源程序-C++ language to achieve chain store linear table insert, delete, search operations such as source code
circular-queue
- 数据结构中循环队列的C++编程实现源代码-Data structure of circular queue in c++ programming source code
a-collection-of-data-structure
- 数据结构算法vc程序集 附带源码和实现exe文件。对于vc开发者是个很好的数据结构学习资料。-it is a good study source for vc programer.
HeapSortDemo
- 经典的排序方法，堆排序实现方法，采用VC写了个小例子，供大家参考-The classical methods of realization method of sort, heap sort, using VC to write a small example, for your reference
SeqStack
- C++代码，运用类，模板，实现栈的基本操作。实现入栈出栈，取顶操作。-C++ code, the use of classes, templates, to achieve the basic operation of the stack. Implement stack stack, take the top operation.