df948755d7
Lazy priority queue is a pure Ruby 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. WWW: https://github.com/matiasbattocchia/lazy_priority_queue
18 lines
345 B
Makefile
18 lines
345 B
Makefile
# Created by: Sunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org>
|
|
# $FreeBSD$
|
|
|
|
PORTNAME= lazy_priority_queue
|
|
PORTVERSION= 0.1.1
|
|
CATEGORIES= devel rubygems
|
|
MASTER_SITES= RG
|
|
|
|
MAINTAINER= sunpoet@FreeBSD.org
|
|
COMMENT= Priority queue implemented using a lazy binomial heap
|
|
|
|
LICENSE= BSD2CLAUSE
|
|
|
|
NO_ARCH= yes
|
|
USE_RUBY= yes
|
|
USES= gem
|
|
|
|
.include <bsd.port.mk>
|