フィボナッチヒープ
挿入、最小値検索、キー値減算、マージ 償却O(1)時間
削除と最小値削除 償却O(log n)時間
二項ヒープでは前者がO(log n)なので、前者の処理が多い時にフィボナッチヒープが有用
Related Pages
"Engineer's way of creating knowledge" the English version of my book is now available on [Engineer's way of creating knowledge]
(C)NISHIO Hirokazu / Converted from [Scrapbox] at [Edit]