Your SlideShare is downloading. ×
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Lazy Pairing Heap
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Lazy Pairing Heap

341

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
341
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. . Lazy Pairing Heaps – PFDS 読書会 –. 日比野 啓 December 15, 2012 . . . . . .
  • 2. Pairing Heap の復習 - ならし時間計算量 Pairing Heap のならし時間計算量 … heap 内のノードの数を n としたとき insert, merge, deleteMin … O(ln n) findMin … O(1) . . . . . .
  • 3. Pairing Heap の復習 - 最悪時間計算量 最悪時間計算量 deleteMin … O(n) findMin, insert, merge … O(1) . . . . . .
  • 4. Pairing Heap の復習 - 最悪時間計算量 最悪時間計算量 deleteMin … O(n) findMin, insert, merge … O(1) . . . . . .
  • 5. Pairing Heap - deleteMin の最悪コスト deleteMin の最悪 (O(n)) ケース n - 1 回の merge が起こる . . . . . .
  • 6. Pairing Heap - データ構造 通常の Pairing ヒープでは子ノードをリストで持っていた datatype Heap = E | T of Elem . T * Heap list . . . . . .
  • 7. Lazy Pairing Heap deleteMin の最悪ケースの再利用に対してならしコストが悪 くならないようにする merge 結果を遅延サンクにキャッシュする . . . . . .
  • 8. Lazy Pairing Heap datatype Heap = E | T of Elem . T * Heap * Heap susp . . . . . .
  • 9. Discussion Discussion . . . . . .

×