Topological sort: Difference between revisions

Content added Content deleted
mNo edit summary
Line 1,528: Line 1,528:
foreach (immutable item, const dep; d)
foreach (immutable item, const dep; d)
if (!ordered.canFind(item))
if (!ordered.canFind(item))
dd[item] = dep.filter!(s => !ordered.canFind(s)).array;
dd[item] = dep.dup.filter!(s => !ordered.canFind(s)).array;
d = dd;
d = dd;
}
}