AlgoMaster Logo

Sort Items by Groups Respecting Dependencies

n=8,m=2,group=[-1, -1, 1, 0, 0, 1, 0, -1],beforeItems=[[],[6],[5],[6],[3,6],[],[],[]]
0 / 34
01234567Group Assignments:-10-11G12G03G04G15G06-17Group Queue:Result:Legend:DefaultProcessingActive GroupVisited
algomaster.io
Step:Start: 8 items, 2 initial groups. Assign groups, then topological sort.