ok so i get the struct approach...so i just make a new struct when i read in seq2 each time i read in the appropriate letter...question is...this seems it's gonna take some performance hit...reding the sequences and getting the match coordinates is basically the first step...i have to perform searches on it later...like astar etc...so i want this to be extremely fast and efficient...
ya data structure is kind of understood...it's really how to frame it to use it in the context of my program...
Here's what i can do:
The reason is that matching can only be done when i have read in both sequences...
Name of Node (either A, B, C, D, E, and F)
Make A, B, C, D, E, and F nodes
While reading characters in seq1
if A then push x-cordinate in 'x-cord vector' of Node A
//similar for all the others
While reading characters in seq2
if A then push y-cordinate in 'y-cord vector' of Node A
//Now I need something to insert all x-cords, y-cords from each letter's vector into that letter's 'matching-cord vector'
if possible i want to do this later step whille i read in seq2...i don't want any substantial performance hit...