mislavzanic / efficient-priority-queues Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Asymptotically efficient PQ implementations, e.g. Brodal Queue, Fibonacci Heap

GPL-3.0 license

1 star 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 84 Commits
Brodal		Brodal
Fibonacci		Fibonacci
.gitignore		.gitignore
LICENSE		LICENSE
README.org		README.org
go.mod		go.mod
main.go		main.go
pqinterface.go		pqinterface.go
sorting.go		sorting.go
util.go		util.go

Repository files navigation

Heaps

This is a repo for source code for my master thesis Efficient implementations of priority queue. PQ implementations here are:

Fibonacci heap
Brodal heap (described in Worst-case Efficient Priority Queues)

About

Asymptotically efficient PQ implementations, e.g. Brodal Queue, Fibonacci Heap

computer-science priority-queue heap fibonacci-heap brodal-queue

GPL-3.0 license

Report repository

Releases

No releases published

Packages

No packages published

Languages

Go 100.0%