Anonymous user
Topological sort: Difference between revisions
m
→{{header|zkl}}: update
(→{{header|Java}}: adjacency entries are only 1 or 0, so are booleans) |
m (→{{header|zkl}}: update) |
||
Line 4,703:
<lang zkl>fcn topoSort(data){ // data is L( L(root,L(leaves)),...)
allDs:=data.pump(List,fcn(rds){ T(Void.Write,Void.Write,rds[1]) }).copy();
roots:=
L:=List();
S:=data.pump(List,'wrap([(r,_)]){ if(allDs.holds(r)) Void.Skip else r }).copy();
| |||