15 April 2026 8:55:26.755 AM test_digraph_adj_test(): Fortran90 version Test test_digraph_adj(), which returns digraphs defined by an adjacency matrix. abc_adjacency_test(): abc_adjacency() returns the abc digraph adjacency matrix. The abc digraph adjacency matrix 1 010 2 001 3 100 digraph_adj_example_abcd_test(): digraph_adj_example_abcd() returns the abcd digraph adjacency matrix. The abcd digraph adjacency matrix 1 0100 2 0010 3 1001 4 1000 digraph_adj_example_cycler_test(): digraph_adj_example_cycler() returns the cycler digraph adjacency matrix. The cycler digraph adjacency matrix 1 001010000 2 000001010 3 000101100 4 001000000 5 010000000 6 000100010 7 000000101 8 100000000 9 000010100 digraph_adj_example_five_test(): digraph_adj_example_five() returns the five digraph adjacency matrix. The five digraph adjacency matrix 1 01000 2 00001 3 10000 4 10000 5 10000 digraph_adj_example_moler_test(): digraph_adj_example_moler() returns the Moler digraph adjacency matrix. The Moler digraph adjacency matrix 1 010001 2 001100 3 000111 4 100000 5 000010 6 100000 digraph_adj_example_sauer_test(): digraph_adj_example_sauer() returns the Sauer digraph adjacency matrix. The Sauer digraph adjacency matrix 1 010000001000000 2 001010100000000 3 010001010000000 4 001000000001000 5 100000000100000 6 000000000110000 7 000000000110000 8 000100000010000 9 000011000100000 10 000000000000100 11 000000000000001 12 000000110010000 13 000000001000010 14 000000000110101 15 000000000001010 digraph_adj_example_sixty_test(): digraph_adj_example_sixty() returns the Sixty digraph adjacency matrix. The Sixty digraph adjacency matrix 1 011111111111 2 000101110111 3 000001011011 4 000000010101 5 000000101111 6 000000010011 7 000000000111 8 000000000001 9 000000000011 10 000000000001 11 000000000001 12 000000000000 test_digraph_adj_test(): Normal end of execution. 15 April 2026 8:55:26.755 AM