- pattern 清华版 模式识别 边肇祺 课后习题答案（1
- dfdddd 用于查看md5值的源码
- diaoyong 打开记事本和计算器
- Lab this demonstrates pseudo 2 dimentional array and labyrinth generation Usage: mylab <width> <height> <density>
- AxInterop.ACTMULTILib Use to connect PLC Mitsubishi Components
- Online Chat 用网络编程技术和C++代码实现的简单网络聊天屋实例(A simple demo for online chatting via C++.)
资源列表
DataStructure
- 清华同方C语言数据结构电子书，供初学者使用，挺好的，较为详细-Tsinghua Tongfang C language data structure of e-books, for beginners to use, very good, and a more detailed
Dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 -Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main cha
SpiralMetrix
- 打印如下规律的螺旋矩阵，尽管存在求数值规律的方法，但本代码的方法更为基本和通用。vc++ 2005环境。 1 2 9 10 25 4 3 8 11 24 5 6 7 12 23 16 15 14 13 22 17 18 19 20 21 -Print the following laws of the spiral matrix, despite the existence of the law for numerical methods, but this code
8_queens
- 8_queens 经典8皇后问题 希望能为刚入门的朋友提供些许帮助-8 Queen
datastructure
- 数据结构，里面有很多算法的参考代码，学算法的要用到哦-Data structure, there are many algorithms reference code, learning algorithm to use to Oh
FFT_C
- 最高1024点的FFT程序，可根据用户设定修改点数，在Microsoft Visual C++平台下调试通过-Maximum 1024 points FFT procedures, can be modified according to user set points in the Microsoft Visual C++ Platform debugging through
huffman
- 利用哈夫曼编码的原理对字符进行处理,最后输出的是对输入的字符的0和1的编码-The principle use of Huffman coding of characters to deal with the final output is the input of 0 and 1 character encoding
EX9-1
- 遍历二叉树并使用3种方法统计结点与叶子结点-Binary Tree Traversal and use three kinds of statistical methods and leaf node node
ds
- 数据结构的C语言实现，包括链表，堆栈，队列，哈希表，二叉树，其中哈希表经过实践可实现1秒查询100万次-Data structure of the C language, including the list, stack, queue, hash table, tree, hash table which can be achieved through practice one seconds query one million times
suanfa
- 数据结构三种先序遍历非递归算法。 数据结构三种先序遍历非递归算法。-Data structure of three first traversal non-recursive algorithm. Data structure of three first traversal non-recursive algorithm.
datastructure
- 数据结构的全部课程实验，车厢调度，一元稀疏，停车站，哈弗曼-Data structure of a full course of experiments, train scheduling, one dollar sparse, parking stations,哈弗曼
exe1-063340
- SSD5 中EX1的参考答案 下载后请参照注释认真分析-SSD5 in reference answer EX1 download Please refer to Notes careful analysis