摘要： 通过分析银行清算网络路径问题，指出问题的实质：单向图上两个底层节点逐层向上搜索，寻找最佳汇集点．并提出了采用产生武系统和Ａ*算法解决此类问题的一般方法．

关键词: 清算网络, 单向图, 图搜索, 产生式系统, A*算法

Abstract: Though analyzing the settlement network problem, the paper points out the essentials of this problem: Searching the best common node from two different bottom nodes on a single-direction graph. At the same time, the paper gives a common method to solve such problems by using the production system and the A* algorithm.

中图分类号: 

• TP18