Update GRPH

This program creates an adjacency list O3. This adjacency lists represents a graph in which each node is a DNA string. Each string has a prefix and a suffix of length k. The strings are connected through these segments if the prefix of one string matches the suffix of another string. 
The program returns edges that connect the strings.