|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| BinQueue | Title: Binomial Queue Description: A binomial queue can be viewed as a special case of Fibonacci Heaps where, after each operation, the rootlist ist consolidated. |
| BinQueueAnalyse | Description |
| BinQueueInteractive | Title: Description: Copyright: Copyright (c) 2003 Company: University of Freiburg -- Institute of Computer Science |
| BinQueueOperationExecuter | Maps operation-ids to the corresponding methods in the FibHeap-data-structure. |
Classes for the binomial-queue plug-in. Important: This plug-in is not completely implemented!
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||