#1969: enormous compile times
---------------------------------+------------------------------------------
Reporter: duncan | Owner: igloo
Type: merge | Status: new
Priority: normal | Milestone: 6.10.2
Component: Compiler | Version: 6.8.1
Severity: normal | Resolution:
Keywords: performance | Difficulty: Difficult (1 week)
Testcase: | Os: Unknown/Multiple
Architecture: Unknown/Multiple |
---------------------------------+------------------------------------------
Comment (by simonpj):
Do you know any such approximations? A quick google search shows lots of
special cases, but nothing that jumped out at me.
Relevant points:
* The vertices each have a "score", and I want to minimise the ''total
score'' of zapped vertices, not just their ''number''.
* It's a ''directed'' graph.
I suppose it's possible that dualising the problem (so the vertices become
edges and vice versa) might lead to other relevant material.
Simon
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1969#comment:16>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
