Assist in finding a minimal spanning tree of diffs among 4 files

diff-mst.rb

#!/usr/bin/env ruby

filenames = ARGV

# hardcoded for 4 vertices
def all_pairs(v)
    [
        [v[0], v[1]],
        [v[0], v[2]],
        [v[0], v[3]],
        [v[1], v[2]],
        [v[1], v[3]],
        [v[2], v[3]]
    ]
end

all_diffs = all_pairs(filenames).map do |a, b|
    `diff -u #{a} #{b}`
end

all_diffs.sort_by{|s| s.length}.each do |i|
    puts i
end