【摘要】 本文利用深探法设计了一个求欧拉图一切无公共边的初级图覆盖(简称覆盖)的算法它由两个子算法组成:算法(Ⅰ):求欧拉图中过一边 e 的所有初级级图.算法 (Ⅱ):求欧拉图的一切无公共边的初级图覆盖.文中定理和算法对有向欧拉图也完全适用。更多还原

【Abstract】 In this paper,We have given an algorithm for generating all edge-disjoint elementary cycle-coverings of an Eulerian graph by depth-first-search.It consists of the following two subroutines:Subroutine(Ⅰ)generates all elementary cycles over an edge e in anEulerian graph.Subroutine(Ⅱ)generates all edge-disjoint elementary cycle-coveringsof an Eulerian graph.The theorem and the algorithm in this paper are also suitable to anEulerian digraph.更多还原