两个图论算法的实现与界面设计  

Realization of two graph algorithms and design of the operational platform of graph algorithms

作　　者：吴军[1] 刘秀兰[1] 

机构地区：[1]北京工业大学电子信息与控制工程学院,北京100022

出　　处：《仪器仪表学报》2007年第S1期378-380,387,共4页Chinese Journal of Scientific Instrument

摘　　要：用C语言实现了2种由广度优先思想衍生出的图论算法,它们分别是求出全部生成树的置换法和找出图中所有基本回路的Paton算法。本文重点叙述了这2种算法的流程,给出了相应算例,并设计实现了一种实用的图论算法操作界面。Two graph algorithms which derive from bread-first search were implemented by using C language in this paper.One algorithm is a replacement method for finding out a graph s all spanning tree,the other is the Paton algorithm for finding out all essential circuit of a graph.This paper mainly introduced the flow of the two graph algorithms.An illustrative example was presented.Also,a practical operational platform of graph algorithm was designed and realized in this paper.

关 键 词：图论算法 全部生成树 Paton算法 操作界面设计 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]