Introduction - If you have any usage issues, please Google them yourself
(1) adjacency list used as the storage structure of directed graphs (2) gives the sequence of all possible topologies. (3) test cases, see Yan Wei Min " data structures problem sets (C language version)" p48 Figure 7.9 title