论文部分内容阅读
An efficient circuit vector space algorithm is presented for enumerating directed circuits ofa directed graph,by which every directed circuit is generated by the ring sum of a fundamental circuit anda subset of the obtained directed circuits,and can be expressed as a linear combination of a basic set of thedirected circuits.
An efficient circuit vector space algorithm is presented for enumerating directed circuits ofa directed graph, by which every directed circuit is generated by the ring sum of a fundamental circuit and a subset of the obtained directed circuits, and can be expressed as a linear combination of a basic set of thedirected circuits.