qiongju

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

说明：  贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。 (greed math)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)

数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)

字符串，实现了文件中查找想要的字符串，并将其标记出来

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)