Shortest Path using Genetic algorithm

Till now i have created a adjacency matrix to save the network(graph).
Now there is an array named load[node1][node2] in which requested path is saved..
For each requsted path genetic algo must provide a shortest path..
i dont know how to save different paths..i mean what type of data structure i should use.because during crossover and mutation i need to do some processing in these paths..i am using these paths as chromosomes..i want to save these paths in a way such it must be easy for me to later on use these paths ..