03 March 2023   7:44:20.074 PM
 
digraph_arc_test():
  FORTRAN90 version
  digraph_arc() implements digraph algorithms.
 
digraph_arc_degree_test():
  digraph_arc_degree() computes the degree of the nodes;
 
  The graph:
 
       1           1       3
       2           1       7
       3           1      10
       4           2       5
       5           2      10
       6           3       6
       7           3       9
       8           4       7
       9           4       8
      10           6       9
      11           8      10
 
  Node, Indegree, Outdegree
 
       1         0         3
       2         0         2
       3         1         2
       4         0         2
       5         1         0
       6         1         1
       7         2         0
       8         1         1
       9         2         0
      10         3         0
 
digraph_arc_euler_circ_next_test():
  digraph_arc_euler_circ_next() finds the next
  Euler circuit of a graph.
 
 
  The digraph:
 
       1           1       2
       2           3       1
       3           1       4
       4           5       1
       5           2       3
       6           4       2
       7           2       5
       8           4       3
       9           3       5
      10           5       4
 
  Circuits:
 
  1    1  7 10  8  9  4  3  6  5  2
  2    1  7 10  8  2  6  5  9  4  3

digraph_arc_is_eulerian_test()
  digraph_arc_is_eulerian() checks if a graph
  has (at least one) Euler circuit.
 
 
  The digraph:
 
       1           1       2
       2           3       1
       3           1       4
       4           5       1
       5           2       3
       6           4       2
       7           2       5
       8           4       3
       9           3       5
      10           5       4
 
  The digraph has an eulerian circuit.
 
digraph_arc_to_digraph_adj_test():
  digraph_arc_to_digraph_adj() converts an arclist
  digraph to an adjacency digraph.
 
 
  The graph:
 
       1           1       3
       2           1       5
       3           2       6
       4           2       8
       5           3       4
       6           3       6
       7           3       7
       8           4       3
       9           5       2
      10           6       4
      11           6       8
      12           7       7
      13           7       9
      14           8       1
      15           9       5
      16           9       7
 
  The digraph:
 
 1  00101000000000000000
 2  00000101000000000000
 3  00010110000000000000
 4  00100000000000000000
 5  01000000000000000000
 6  00010001000000000000
 7  00000010100000000000
 8  10000000000000000000
 9  00001010000000000000
10  00000000000000000000
11  00000000000000000000
12  00000000000000000000
13  00000000000000000000
14  00000000000000000000
15  00000000000000000000
16  00000000000000000000
17  00000000000000000000
18  00000000000000000000
19  00000000000000000000
20  00000000000000000000
 
digraph_arc_test():
  Normal end of execution.
 
03 March 2023   7:44:20.074 PM