资源列表
shuangshexian
- 射线跟踪的双射线模型算法，基于C语言的编程实现-Two-ray model ray-tracing algorithm, based on the C programming language,
VisualHanoi
- 动态显示汉诺塔的自动搬运过程，每个盘用不同颜色的矩形表示，有很好的教学用途。-Dynamic Display Tower of Hanoi' s automatic handling processes, each with different colored rectangular plate, said there is a good teaching purposes.
Data-Structure-section-algorithm
- 包含了大学计算机的数据结构算法，Eratosthenes筛选法素数、huffman编码、多种查找、二叉树创建与遍历、多种排序、图的建立和遍历等。 -Contains the data structure algorithms university computers, Eratosthenes screening primes, huffman coding, multiple search, binary tree traversal create a variety of sorting
UserCheckIn
- 编程实现二叉树结构及其相关功能，以存储用户信息，不使用标准模板类的二叉树结构和函数。同时根据二叉树的变化情况，进行相应的平衡操作，即AVL平衡树操作，四种平衡操作都考虑。采用相应的数据结构模拟用户登录系统，其功能包括用户登录、用户密码更新、用户添加和用户删除等。(The programming implements the two fork tree structure and its related functions to store user information and do not
cpp_design_pattern
- 包括学习《大话设计模式》的笔记、截图，以及C++的实现源码-Including learning " Westward design mode" notes, screenshots, and C++ to achieve source
BinTree
- 一个简单还原二叉树并在屏幕输出树形的小程序，帮同学做的数据结构作业，估计对初学者会有些帮助-Restore a simple binary tree and tree on the screen output of the applet to help students to do homework data structure, it is estimated that it might be useful for beginners
TansportInfo.tar
- 任意两个城市之间的最短路径。可以输入城市信息、构建城市网络、算出三种最小代价。-Any shortest path between two cities. You can enter a city information, build the city network, calculate the three kinds of minimum cost.
digital
- 利用广度优先搜索算法解决八数码难题，寻找从初始状态变换到目标状态的最优解-Use breadth-first search algorithm to solve eight digital problem, seek transformation initial state to target state optimal solution
erchapaixushu
- 用MFC实现的数据结构的二叉排序树序程序，可以正常运行。-MFC implementation of the binary sort tree data structure sequence program can run properly.
computer
- 简单计算器的实现 ，此计算器是用java实现，仅供参考-simple computer design and make it true
final.rar
- 有以下七种排序法的实现方法，1冒泡排序,2顺序插入排序,3快速排序,4折半插入排序,5希尔排序,6.选择排序,7归并排序，并分析了各种排序法的性能。程序调通了，完全没有问题。,There are seven methods to sort the law, 1 Bubble Sort, Insertion Sort 2 order, 3 Quick Sort, Insertion Sort 4 half, 5 Hill sort, 6. Choose Sort, 7 merge sort, an
st
- 添加一个Button，更新视图，在函数内输入 Invalidate() -Add a Button, update the view, enter the function Invalidate ()