A Search Algorithm for Finding Basic Sets of Directed Circuits and All Directed Circuits of a Digraph

Xiong De-yan

您当前的位置：

首页 >

文章列表页 >

A Search Algorithm for Finding Basic Sets of Directed Circuits and All Directed Circuits of a Digraph

更新时间：2025-12-08

- A Search Algorithm for Finding Basic Sets of Directed Circuits and All Directed Circuits of a Digraph
- Acta Electronica Sinica Issue 6, Pages: 42-47(1986)
- 作者机构：
  
  同济大学
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1986
- 稿件说明：
移动端阅览
[1]熊德琰.生成有向图的有向回路基集及全部有向回路的一个搜索算法[J].电子学报,1986(06):42-47.

Xiong De-yan. A Search Algorithm for Finding Basic Sets of Directed Circuits and All Directed Circuits of a Digraph[J]. Acta Electronica Sinica, 1986, (6): 42-47.
[1]熊德琰.生成有向图的有向回路基集及全部有向回路的一个搜索算法[J].电子学报,1986(06):42-47. DOI：

Xiong De-yan. A Search Algorithm for Finding Basic Sets of Directed Circuits and All Directed Circuits of a Digraph[J]. Acta Electronica Sinica, 1986, (6): 42-47. DOI：

摘要

本文证明了几个关于有向图基本性质的定理。在此基础上

提出一个同时生成有向图的有向回路基集和全部有向回路的算法。该算法能系统地、无重复地和成组地产生全部有向回路。从而解决了求有向回路基集的有效算法问题。

Abstract

Some theorems about fundamental properties of the digraphs are proved. A search algorithm for finding simultaneously the basic sets and whole body of directed circuits is presented. It generates all circuits systematically

without duplication and in groups. Thus

the problem of efficiently finding the basic set of directed circuits in a digraph is solved.

关键词

Keywords

references

Views

190

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰