category/87636.aspxzh-CNSun, 29 Jun 2008 21:22:00 GMT60EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2008/06/29/2596467.aspxSun, 29 Jun 2008 21:00:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2008/06/29/2596467.aspxcomments/2596467.aspxhttp://blog.csdn.net/EmilMatthew/archive/2008/06/29/2596467.aspx#Feedback0comments/commentRss/2596467.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2596467这是一篇非常老的技术文档，但是时间的流逝却无法抹去此文作为精品技术文档的事实。这篇文章，无论是原理还是代码，都非常的简明而精当，即使读者对水波摸拟之类不感兴趣，通览此文，亦是一种享受。现在，用baidu搜水波摸拟之类已找不到这篇文章了，故转载之，以分享精品。<img src ="aggbug/2596467.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/10/31/1359172.aspxTue, 31 Oct 2006 20:41:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/10/31/1359172.aspxcomments/1359172.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/10/31/1359172.aspx#Feedback5comments/commentRss/1359172.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1359172A*，最优解提取，AS2 <img src ="aggbug/1359172.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/10/17/1338808.aspxTue, 17 Oct 2006 23:15:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/10/17/1338808.aspxcomments/1338808.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/10/17/1338808.aspx#Feedback20comments/commentRss/1338808.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1338808A*,启发式算法,最优路径,交互式,AS2<img src ="aggbug/1338808.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/10/14/1334737.aspxSat, 14 Oct 2006 20:41:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/10/14/1334737.aspxcomments/1334737.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/10/14/1334737.aspx#Feedback0comments/commentRss/1334737.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1334737Intorduction to Heuristics Algorithm<img src ="aggbug/1334737.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/07/14/922705.aspxFri, 14 Jul 2006 23:01:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/07/14/922705.aspxcomments/922705.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/07/14/922705.aspx#Feedback2comments/commentRss/922705.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=922705有时，可以用图来表示一类事物或集合间的先后依赖关系。比如：集合A 包含于B,就画一条由B指向A的箭头；如果C事件较D事件先发生，则画一条由C指向D的箭头。建立完这样的依赖关系图，就可以对其依赖的先后关系进行排序。<img src ="aggbug/922705.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/06/05/774458.aspxMon, 05 Jun 2006 17:25:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/06/05/774458.aspxcomments/774458.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/06/05/774458.aspx#Feedback8comments/commentRss/774458.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=774458模糊聚类分析的实现（CuteFuzzy V0.5 Released） <img src ="aggbug/774458.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/01/24/587751.aspxTue, 24 Jan 2006 21:16:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/01/24/587751.aspxcomments/587751.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/01/24/587751.aspx#Feedback0comments/commentRss/587751.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=587751根据ascii码文件中各ascii字符出现的频率情况创建Haffman树，再将各字符对应的哈夫曼编码写入文件中.<img src ="aggbug/587751.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2006/01/17/582381.aspxTue, 17 Jan 2006 21:43:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2006/01/17/582381.aspxcomments/582381.aspxhttp://blog.csdn.net/EmilMatthew/archive/2006/01/17/582381.aspx#Feedback2comments/commentRss/582381.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=582381关键是要处理好如何正确的在搜索的过程中存储搜索树中的子结点，并正确的进行访问.<img src ="aggbug/582381.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/11/19/532885.aspxSat, 19 Nov 2005 13:05:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/11/19/532885.aspxcomments/532885.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/11/19/532885.aspx#Feedback16comments/commentRss/532885.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=532885将递归改成非递归,还是有一定难度的.<img src ="aggbug/532885.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/11/09/526220.aspxWed, 09 Nov 2005 16:52:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/11/09/526220.aspxcomments/526220.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/11/09/526220.aspx#Feedback0comments/commentRss/526220.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=526220借助栈将递归程序转换成非递归程序<img src ="aggbug/526220.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/10/25/516323.aspxTue, 25 Oct 2005 16:40:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/10/25/516323.aspxcomments/516323.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/10/25/516323.aspx#Feedback2comments/commentRss/516323.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=516323[String,算法]字符串匹配的KMP算法<img src ="aggbug/516323.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/10/06/496068.aspxThu, 06 Oct 2005 21:24:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/10/06/496068.aspxcomments/496068.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/10/06/496068.aspx#Feedback0comments/commentRss/496068.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=496068[栈应用,深度优先]迷宫问题的求解<img src ="aggbug/496068.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/10/03/494692.aspxMon, 03 Oct 2005 21:16:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/10/03/494692.aspxcomments/494692.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/10/03/494692.aspx#Feedback0comments/commentRss/494692.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=494692[AS2,数据结构]栈的实现<img src ="aggbug/494692.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/09/15/481411.aspxThu, 15 Sep 2005 14:24:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/09/15/481411.aspxcomments/481411.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/09/15/481411.aspx#Feedback3comments/commentRss/481411.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=481411[回溯法]从蛮力算法起步,谈八皇后问题的求解:<img src ="aggbug/481411.aspx" width = "1" height = "1" />EmilMatthewhttp://blog.csdn.net/EmilMatthew/archive/2005/09/12/478369.aspxMon, 12 Sep 2005 18:33:00 GMThttp://blog.csdn.net/EmilMatthew/archive/2005/09/12/478369.aspxcomments/478369.aspxhttp://blog.csdn.net/EmilMatthew/archive/2005/09/12/478369.aspx#Feedback0comments/commentRss/478369.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=478369[Data Structure]数据结构学习之链表小结[中]---经典问题<img src ="aggbug/478369.aspx" width = "1" height = "1" />