| 6 | | This idea comes from the fact that the LEDA library also contains such an implementation of the binary heap structure and the Dijkstra algorithm, which turned out to be particularly efficient on some graphs. It was faster than the usual implementation by a factor between 1.5 and 2 on large graphs generated with NETGEN. |
| 7 | | |
| 8 | | Therefore, it would be nice to introduce such implementations in LEMON. I think, they would lead to better performance in many practical cases, because not too many duplications would be expected on typical graphs. However, there are some problems with this proposal. First, such heaps would not conform to the current heap concept. Second, using them would reqiure different implementation of the algorithms. |
| | 6 | It would be nice to introduce such implementations in LEMON. I think, they would lead to better performance in many practical cases, because not too many duplications would be expected on typical graphs. However, there are some problems with this proposal. First, such heaps would not conform to the current heap concept. Second, using them would reqiure different implementation of the algorithms. |
