说明:学习VC的时候写的,求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set. <水中雁> 在 2008-10-13 上传
| 大小:1.93mb | 下载:0
说明:构建哈夫曼树,并对给定的字母进行编码,还能将数字密码解码成字符串-Construction Huffman tree, as well as letters to the code, but also to decode the password string <孟娜> 在 2008-10-13 上传
| 大小:1.15kb | 下载:0