Will take an array of dot path sorted paths and return the minimal list common paths.
So sub-paths will be filtered out if we already contain a parent path E.G. a.b will be removed if we also include a.
Duplicate paths will be removed, so a will be removed if two a's exist.
Will take an array of dot path sorted paths and return the minimal list common paths. So sub-paths will be filtered out if we already contain a parent path E.G.
a.bwill be removed if we also includea. Duplicate paths will be removed, soawill be removed if twoa's exist.