ba2f73992d
A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.
12 lines
366 B
Makefile
12 lines
366 B
Makefile
# $NetBSD: Makefile,v 1.1 2016/10/10 23:15:34 taca Exp $
|
|
|
|
DISTNAME= lazy_priority_queue-0.1.1
|
|
CATEGORIES= devel
|
|
|
|
MAINTAINER= pkgsrc-users@NetBSD.org
|
|
HOMEPAGE= https://github.com/matiasbattocchia/lazy_priority_queue
|
|
COMMENT= Priority queue implemented using a lazy binomial heap
|
|
LICENSE= 2-clause-bsd
|
|
|
|
.include "../../lang/ruby/gem.mk"
|
|
.include "../../mk/bsd.pkg.mk"
|