Topological sort: Difference between revisions
m
→{{header|Haskell}}: Used Data.Bifunctor in place of Control.Arrow
m (added to a category.) |
m (→{{header|Haskell}}: Used Data.Bifunctor in place of Control.Arrow) |
||
Line 2,442:
=={{header|Haskell}}==
<lang haskell>import Data.List ((\\), elemIndex, intersect, nub)
import
combs 0 _ = [[]]
Line 2,472:
| otherwise = foldl makePrecede [] dB
where
dB =
makePrecede ts ([x], xs) =
nub $
| |||