资源列表
last
- n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last
student_manager
- 学生课程管理系统,一个学习数据结构过程中的必备程序。-students information manager
juzhen
- 先输入矩阵的维数，再输入该矩阵，然后通过该算法从大到小输出该矩阵的各行各列和主辅对角线的和-First dimension of input matrix, and then enter the matrix, and then through the smallest of the algorithm output lines of the matrix columns and the main diagonal and Des
efficience
- 多种排序算法（冒泡排序，插入排序，堆排序等等）效率分析-Efficiency analysis of a variety of sorting algorithms
ftds_slides
- 数据结构C++语言描述--应用标准模板库-Data Structures C++ language descr iption- Application of Standard Template Library
SLinklist
- 静态链表,c++语言描述，数据结构示范，模板类-staticlinnkedlist
SimpleBinaryTreeExample
- 一个关于二叉树的小实验例子，包括整个的过程文件-A small experiment on the binary tree example, including the whole process of document
dijkstra
- dijkstra算法源代码，实现了dijkstra算法，并附有一个简单路网文件-dijkstra algorithm source code, to achieve the dijkstra algorithm, together with a simple network file
dijkstra
- Dijkstra算法 邻接表向量实现（求最短路径及具体走法） -Dijkstra algorithm to achieve adjacency list vector (for the shortest path and the specific moves)
huffmansystem
- 实现霍夫曼编码系统。包含文件hfmfunc.cpp、main.cpp、huffman.h-Huffman coding system to achieve. Include file hfmfunc.cpp, main.cpp, huffman.h
aoe
- AOE网关键路径（Activity On Edge） 数据结构其中前两个数代表两个顶点之间的通路，后两个数分别代表最早开始时间和最迟开始时间 带有*的通路组成关键路径； -Key path AOE Gateway (Activity On Edge) the first two of which data structure to represent the path between two vertices, the number of the latter two represent t
aa
- 罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research