https://gcc.gnu.org/bugzilla/show_bug.cgi?id=67992
Jan Hubicka <hubicka at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|UNCONFIRMED |ASSIGNED
Last reconfirmed| |2016-05-20
CC| |hubicka at gcc dot gnu.org
Assignee|unassigned at gcc dot gnu.org |hubicka at gcc dot
gnu.org
Ever confirmed|0 |1
--- Comment #6 from Jan Hubicka <hubicka at gcc dot gnu.org> ---
I will take a look. The algorithm choosing minimal spanning tree can be
adjusted to make the solving algorithm converge faster. I will need to re-think
the details. It is well over a decade.
