I've implemented the map in terms of the Graph structure (means in terms of how many different kmer exists in it) and a List of well different Colors (not tested yet, but can get easily adjusted in a seperate function with predefined colors or algorithms)
The method will create for first a list of n colors, where n belongs to the count of different kmers in the Graph. Then it will iteratively pick the next unused color for a new kmer. (and compare the ones, who are already declared) After all you get a returned vector of vectors with Color objects, where the colors in each vector stands for the color of the kmers in each Sequence.
NOTE: My first idea was to map unique for each kmer itself, but i don't got a solution in this week for that problem for kmers with a k which is not 3.
I've tried to adjust the posted coding style, too.
About my structure:
I've implemented the map in terms of the Graph structure (means in terms of how many different kmer exists in it) and a List of well different Colors (not tested yet, but can get easily adjusted in a seperate function with predefined colors or algorithms)
The method will create for first a list of n colors, where n belongs to the count of different kmers in the Graph. Then it will iteratively pick the next unused color for a new kmer. (and compare the ones, who are already declared) After all you get a returned vector of vectors with Color objects, where the colors in each vector stands for the color of the kmers in each Sequence.
NOTE: My first idea was to map unique for each kmer itself, but i don't got a solution in this week for that problem for kmers with a k which is not 3.
I've tried to adjust the posted coding style, too.