我写的,画出最短路径,及最小生成树 Prim Dijistra算法+ GDI实现-I write to depict the shortest path, and the smallest Prim Dijistra Spanning Tree Algorithm to achieve GDI

超强寻找最短路径和全部结点遍历。用了GDI显示。,Super find the shortest path and all nodes traversal.

实现统计字母频率，实现哈夫曼树的建立，并现实0 1代码，MFC GDI编程，还实现了发送，译码功能，接受，顺便还实现了聊天功能-Achieve statistical letter frequencies, to achieve the establishment of Huffman trees, and reality 01 code, MFC GDI programming, but also realized the sending, decoding functions to acce

Prime算法生成最小生成树，使用GDI+将最小生成树画出-Prime algorithm to generate minimum spanning tree, minimum spanning tree to use GDI+ to draw