.hgignore
author |
Peter Kovacs <kpeter@inf.elte.hu> |
|
Thu, 06 Aug 2009 20:12:43 +0200 (2009-08-06) |
changeset 760 |
83ce7ce39f21 |
parent 517 |
2b6d5d22bb23
|
child 866 |
2d9c6566a604 |
permissions |
-rw-r--r-- |
Rework and fix the implementation of MinMeanCycle (#179)
- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).
This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.