On 6/27/05, Arjun Guha <[EMAIL PROTECTED]> wrote: > It's the all-pairs > shortest paths data for a map of the Hyde Park area of Chicago (no real > reason, really).
I wonder: is there really no way to do Floyd-Warshall in Haskell? -- regards, radu http://rgrig.blogspot.com/ _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
