99 questions/Solutions/81 - Revision history

Trackbully: Add an additional recursive solution to the problem

Trackbully — Wed, 04 Jan 2012 17:10:19 GMT

Add an additional recursive solution to the problem

Kizzx2: Added another solution

Kizzx2 — Thu, 28 Jul 2011 15:48:33 GMT

Added another solution

Duck lee: paths :: Int -> Int -> [(Int , Int)] -> Int paths start end zs = let (xs,ys) = partition (\(_,z) -> z == end ) zs in map (++ [ end] ) ( concat . map (\(e, _) -> if e ==

Duck lee — Mon, 18 Apr 2011 05:45:42 GMT

paths :: Int -> Int -> [(Int , Int)] -> Int paths start end zs = let (xs,ys) = partition (\(_,z) -> z == end ) zs in map (++ [ end] ) ( concat . map (\(e, _) -> if e ==

Duck lee at 05:41, 18 April 2011

Duck lee — Mon, 18 Apr 2011 05:41:37 GMT

Wapcaplet at 01:25, 18 July 2010

Wapcaplet — Sun, 18 Jul 2010 01:25:43 GMT