The goal of this project is to create a simple graphical didactic application demonstrating the usage of Fibonacci's heaps rather than priority queues within the Prim's minimum spanning tree algorithm in order to achieve better time complexity (most operations run at amortized time O(1)) than we'd achieve with regular priority queues.
-
Notifications
You must be signed in to change notification settings - Fork 1
License
eskultety/FibonacciHeaps_demo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published