I'd guess because (1) they're simple, and (2) they're fast enough. Fibonnacci heaps are probably one of the most complicated data structures known to man. Second, O(log N) is not that bad, so there's relatively little to be gained. Even though Fib heaps are O(1) amortized where binary heaps are O(log N), the constants are large enough that especially in Perl, they'll probably cause them to lose for most reasonable values of N. There isn't that much difference between O(log N) and O(1) (or O(log log N) for binomial), so constants can easily outweight the gains. For example:

      log N    log log N    1

256   8        3            1

1K    10       3.3          1

1M    20       4.3          1

So if inserting an item in a fibonnacci heap is 10 times as complicated as inserting one in a binary heap (not entirely unlikely), the binary heap is faster for 1000 elements.

/s

---

---

• Are you posting in the right place? Check out Where do I post X? to know for sure.
• Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:

  <code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>

• Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
• Want more info? How to link or How to display code and escape characters are good places to start.