1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建...

一个表达式计算器的算法,编译后运行,输出output.txt-An expression calculator algorithms, compiled to run, the output output.txt

学校成绩管理系统 2006 如果遇到MD5加密文件，而又不知道的密码的， 请在数据库中换上这组加密的数据吧 469e80d32c0559f8 那么密码就是admin-School management system in 2006 if they are MD5 encrypted file, not knowing the password, please put in the database encrypted data for this group it is the admin password so 469e80d32c0559f8

ORACLE课程设计（5个代码段）-ORACLE curriculum design (5 code)

sqlite 3.3.8 支持加密的版本-sqlite 3.3.8 supports encrypted version

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

DES,MD5,ZLIB算法源代码-DES, MD5, ZLIB algorithm source code

大数相乘算法,使用C++语言在VC下实现.-large numbers multiply algorithm, the use of C language in the VC achieve.

自己写的堆栈算法，C语言＋Visual C++6.0环境下-Write their own stack algorithm, C language Visual C++ 6.0 environment

本程序是在c调试成功的．对初学者有很大的作用！-the procedure was successful c debugging. For beginners a significant role!

《数据结构与程序设计》书本所有源代码-" Data Structure and Program Design" books of all the source code