Name: Anonymous 2009-10-28 21:29
Name one noteworthy program that was coded in LISP.
I'll wait.
I'll wait.
computeGraph removalOrder =
zip (init edgeStarts ++ [lastVertex]) (removalOrder ++ [last edgeStarts])
where
vertices = [1..maximum removalOrder + 2]
((lastVertex:_), edgeStarts) = mapAccumL getStart vertices (tails removalOrder)
getStart vertices order = ((,) =<< (vertices \\) . (:[])) $ head (vertices \\ order)