finding motif in a graph(network)

The program should read an input file which defines a network(directed graph). The first line of the file gives the number of the network nodes and the subsequent lines gives the edges. Some order of these edges is called as motif(FFL) Program should find motifs in given network and should give an output file. The detailed document is attached. Developer will get more specific document after taking the job. Developer should know data structures well(Graph, adjacency list,matrix etc.)