It's useful, but not groundbreaking. The equivalent to a minimal spanning tree in directed graphs is called an optimal branching. The algorithm for that was originally known Edmonds' algorithm in most of the world after the discoverer. It was later discovered that Chu and Liu already published essentially the same idea two years earlier in a Chinese journal. Even now, it is still often referenced only by Edmonds' name. This happens often enough.