To continue regarding the graph edges, my dream/guess would be that the edges are measures of the number of common markers. But I am having trouble formulating the exact definition of that measure. Am I on the right track?
2010/2/13 Brian Schott <[email protected]>: > While in fact the order of markers in each clue can be important to > the clue's ultimate use, during the sorting phase, the order could be > revised to say the order of the ascii vector a. . If each clue were > first sorted, then all clues sorted in this pseudo alphabetic form, > if the indices of the clues were noted at first, they could be used to > retrieve the original clues. > > That all makes me think of lexicographic sort order and maybe about > http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search . The > wikipedia page is pretty brief, and I wonder if it could be applied to > this problem. > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
