[Haskell-cafe] need help on building a huge graph

Hi, cafe I'm recently solving some algorithm puzzles from previous Google Code Jam rounds, and today I met some problem I can't solve now. It's a problem (Round 3 2010, B) that the solution require to find a shortest path in a graph with about 100,000 vertices and 50 edges from each vertex.

Re: [Haskell-cafe] need help on building a huge graph

sorry, it's 15 seconds. It's a typo On Wed, May 11, 2011 at 3:20 PM, Bin Jin bjin1...@gmail.com wrote: Hi, cafe I'm recently solving some algorithm puzzles from previous Google Code Jam rounds, and today I met some problem I can't solve now. It's a problem (Round 3 2010, B) that the

Re: [Haskell-cafe] need help on building a huge graph

On Wednesday 11 May 2011 09:25:05, Bin Jin wrote: sorry, it's 15 seconds. It's a typo It's less for me, something like 5.8s compiled without optimisations, 3.6s with -O2 (Pentium4, 3.06GHz). The overwhelming part of that is spent in GC: MUT time0.69s ( 0.73s elapsed) GCtime