Description This algori thm investigates the existence of elementary circuits o f a directed graph G. Data: n is the number of vertices; arc(i,j) is the Boolean procedure with two parameters i, j o f type integer, which is equal to true if (i, j ) E G, and false otherwise. Results: (a) I f the graph has no circuits, then the following sequence of symbols will be printed: Graph without elementary circuits. Ordered numerat ion of vertices /1 i~ is . . i,, where (/1, i2, . . . , iv) is the permutat ion of numbers (1, 2, . . . , n), and a new numerat ion o f vertices such that if (j, i) E G, then j < i. (b) In the other case the following sequence of symbols will be printed: Graph contains the circuits: Circuit i~ i2 . . . ir fi Circuit j~ j~ . . . j , ]j
[1]
H. H. Rachford,et al.
On the numerical solution of heat conduction problems in two and three space variables
,
1956
.
[2]
I. D. Hill,et al.
Algorithm 304: Normal curve integral
,
1967,
CACM.
[3]
A. Myshkis,et al.
SOME RESULTS AND PROBLEMS IN THE THEORY OF DIFFERENTIAL EQUATIONS
,
1967
.
[4]
K. Arnold,et al.
Tables for Computing Bivariate Normal Probabilities
,
1958
.
[5]
E. Wachspress.
Extended Application of Alternating Direction Implicit Iteration Model Problem Theory
,
1963
.
[6]
H. H. Rachford,et al.
The Numerical Solution of Parabolic and Elliptic Differential Equations
,
1955
.