资源列表
shujujiegoutijidaan
- 清华大学出版，数据结构题集的答案。非常详细，每一道题都有详解-Tsinghua University, publishing, data structures, the answer to the problem sets. Very detailed, each question has a Detailed
huffman
- 信息论程序中的霍夫曼编码程序，喜欢的就速度抱走吧-Huffman coding procedures in the information theory in the program, like the speed of which go
BiTree432
- 数据结构课程试验。关于二叉树的各种课本操作-the operation of BiTree
Graoh821
- 数据结构课程试验。关于图的各种课本操作。-The operation of Graph
Josephus
- 约瑟夫(Josephus)环问题 设n个人围坐在一个圆桌周围，现在从第s个人开始报数，数到第m个人，让他出局；然后从出局的下一个人重新开始报数，数到第m个人，再让他出局，如此反复直到所有的人全部出局为止。 下面要解决的约瑟夫(Josephus)环问题是：对于任意给定的n，s和m，求出这n个人的出局序列。要求以单循环链表作为存储结构，实现约瑟夫环问题。然后使用n=9，s=1，m=5，以及n=9，s=1，m=10作为输入数据，检查你的程序的正确性和健壮性。 -Joseph (Josep
vcPP-the-shortest-path
- 最小路不交化算法，用于求网络图的可靠度，或者评价网络的可靠度-Minimal path does not cross the algorithm for seeking the reliability of the network diagram, or to evaluate the reliability of the network
Balance-two-forks-tree
- 将二叉排序树转变为平衡二叉树，其操作有:创建二叉树、插入数据、 删除数据、输出、销毁二叉树和退出 -Binary sort tree into a balanced binary tree, its operations are: create a binary tree, insert data, delete data, output, the destruction of the binary tree and exit
Advance-and-retreat-method
- 用进退法、0.618法求解函数的解—实例。附有测试实例-Advance and retreat method, 0.618 Method function of the solution- an instance of. Attached to the test instance
VCPMFCPJosephPLink
- 数据结构优秀实验，约瑟夫环出列顺序动画显示，C++ MFC实现，含源代码-Excellent experimental data structures, Joseph ring column order animation C++ MFC implementation, including source code
heapsort
- 堆排序，建堆过程，调整堆，堆排序复杂度-Heap sort, built reactor process, adjust the heap, heap sort complexity
heapsort_new
- 堆排序，建堆过程，调整堆，推导堆排序复杂度-Heap sort, built reactor process, adjust the heap, heap sort complexity
sizeof_virtual
- 测试虚函数的例程，测试虚函数所占用的内存，内存分部-Test virtual functions routines, the memory occupied by the test virtual functions, memory segments