×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • RANDOM
  • Join our Internship ๐ŸŽ“
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux ๐Ÿ’ฝ
  • ๐Ÿ”Š Data Structures
  • Graph Algorithms
  • Dynamic Programming ๐Ÿ’‘
  • Home

fibonacci heap

A collection of 1 post

Data Structures

Fibonacci Heap

A Fibonacci heap is a heap data structure similar to the binomial heap. It uses Fibonacci numbers and also used to implement the priority queue element in Dijkstraโ€™s shortest path algorithm which reduces the time complexity from O(m log n) to O(m + n log n)

Rohit Kumar Rohit Kumar
OpenGenus IQ © 2022 All rights reserved โ„ข [email: team@opengenus.org]
Top Posts LinkedIn Twitter