This is Maple 2019. Suppose a directed graph D is given. 

I know that "Cycles≔CycleBasis(D)" lists down all the cycles in D and "numelems(Cycles)" gives the number of cycles in D. But if I only want to count the number of directed cycles of length k, say k=4, in D, is there a Maple function that gives us that?

Thank you all.

I need help please. This is Maple 2019. I want to run through all possible bipartite tournaments with exactly 4 vertices in each partite set, and for each bipartite tournament compute the number of pair of vertices which has at least one common out-neighbor. 
1) The following code stops after two lines of output. Please advise how the code can be fixed.  
2) The printing of the adjaceny matrix using WeighMatrix(G) seems wrong too.

Thank you very much.😭😭