搜索资源列表
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the r
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the roo
shujujiegou
- 主要 文本格式化 数据结构 课题源码 绝对好用 可以格式化文本 还有其他很多源码 我一个学期的结晶 如 约瑟夫环 进制转换 z3回文判断等等 共有18个课题-The main subject of text formatting source data structure can be absolutely easy to use formatted text there are many other source I have one semester
Match
- 对任意文本进行括号匹配，提示错误行数和列数。-For any matching text in brackets, indicating the error number of rows and columns.
hfm
- 能够实现对输入的原文字符进行哈弗曼树的构建，对原文进行编码，同时可实现对01报文的解码-Can be achieved on the input of the original characters Havermann tree was constructed on the original text coding, can achieve 01 to decode packet
text
- 数据结构试题和答案，包含1800个,希望对编程的有帮助哦-the test of data organization
WebPages_InvertedFile
- 根据中文分词结果生成倒排文档，并将结果输出到文本文件中。-Generate the inverted file based on the result of word-splitting, and output to a text file.
Exercise8_22
- 写一个程序来创建一个Exercise8_22.txt 文件，随机的100个整数，从文件中读出这些数，并且排序。-Write a program to create a file named Exercise8_22.txt if it does not exist.Wite one hundred integers created radomly into the file using text I/O .Integer are separated by speces in the file.
fileInandOut
- 利用二叉树的功能实现了对文本文件的更改删除，插入等操作，-Realization of the function using a binary tree of changes to the text file deletion, insertion and other operations,
FrameWorkMatrix
- 计算骨架阵的算法，数组是动态分配的，用类写的，有很好的封装性和移植性。并且输入时从文本文件TXT读取的！-Skeleton matrix calculation algorithm, the array is dynamically allocated, with the class to write, have a good package and portability. And input from a text file TXT read!
searchBST
- 二叉搜索树实现的文本文件单词索引表，可将文本中单词按字母顺序列出并且列出每个单词在文本中出现的次数-Binary search tree implementation of the text file the word index table, you can text the word list in alphabetical order and each word in the text are listed in the number of occurrences
code
- 二分法对文本进行排序。比较简单。好像帮一个朋友做毕业设计的时候用到的代码。-Dichotomy of the text sort. Simple. Seems to help a friend used to do when the graduate design code.
kkk
- 给定K个单词作为文本的开始。程序每次生成一个单词，其过程为：读取文本中最后的K个单词，并在书中寻找这K个单词连续出现的所有位置，然后从中随机挑选一个位置，并把该位置之后的一个单词加入到文本中。该过程不断重复，直到生成的文本达到最大单词数，或者生成的单词恰好是这本书的最后一个单词。-Given K words as the beginning of the text. Each program generates a word, the process is: read the text in a
Document
- 进行文本输入及输出，统计个数，并且查找输入串的次数-For text input and output, statistical number, and find the number of input strings
Demo_caut
- Search algortim , this apllication allows you to search text from a textbox
HuffmanCode
- 本程序是数据结构中常见的哈弗曼编码的实现，通过统计文本文件中的字符出现次数，在另一个文本文件中输出统计次数及对应编码，在两一个文本文件中可以给出英语短文对应的翻译编码。-This procedure is common Havermann data structure encoded to achieve, through the statistics text file in the number of characters that appear in another text file i
code
- Mark Allen Weiss 1987年在普林斯顿大学获得计算机科学博士学位,师从著名算法大师Robert Sedgewick,现任美国佛罗里达国际大学计算与信息科学学院教授.他曾经担任全美AP(Advanced Placement)考试计算机学科委员会的主席(2000-2004).他的主要研究方向是数据结构,算法,和教育学.- In this second edition of his successful book, experienced teacher and autho
code
- (1) 生成n个[0,65535]以内的整数随机数，存入文本文件； (2) 将n个随机数从小到大排序，并显示结果。排序采用k桶法 (3)用函数编制混合同余的伪随机数发生器-(1) generate n-[0,65535] integer random number within, into a text file (2) n random numbers from small to large order, and displays the results. Sort by k B
traversinggraph
- 图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况-Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~
Hel
- 数据结构中的拓扑排序，用拓扑排序来完成大学四年的课表排序，从文本文档中读取课程（乱序）课时，序号等信息，根据先修后修的原定顺序，按照拓扑排序来完成课表。-topo assessment in structure of computer,to finish the timetable for the whole four years at colleage. Read information from a text,an the number of the subjects and the m