[Olsr-dev] Improving SPF with binary heaps

[Bastian Bittorf]

* Diogo Gonçalves <(spam-protected)> [09.07.2015 21:49]:
> intendendas a priority queue. To achieve O(log n) performance, AVL requires
> nodes withunique key values, which is not reasonable for a priority queues
> since differentnodes can have the same priority. In fact, in the olsrd's

very interesting. is this the case e.g. for 

  nodeA
| | | | |
B C D E F

(whhen all nodes have the _same_ ETX to A)?

bye, bastian