A modern programming language that makes developers happier.

kotlinlang

I am writing the only <http://Geni.com|Geni.com> Android <https://github.com/shmueldabomb441/GeniForAndroid|app> (none are available as of yet), and am working on a feature to compare multiple family trees, based on <https://github.com/elliotchance/gedcom/|previous work> written to compare two trees (complicated). I started by making a map of diffs between each tree, so the diff of tree x with respect to y can be gotten through `diffs[x][y]`. 

I don't even have clear what the edge cases are in a k-diff (based on <https://en.wikipedia.org/wiki/K-way_merge_algorithm?wprov=sfla1|k-way merge>); with a 2-way diff, a given element is either in left, right, or both (in which case a similarity value is given to represent how similar they are). 

And how do I represent a k-diff graphically? Some of my thoughts now are along the lines of: find the "added" elements that are only in some lists, and make those green; removed elements that are missing from some lists, and make those red; changed elements, and make those orange. But how do I determine those things? All k elements could be different, and their similarity values could all be different relative to each other.