9f18761b19
This is a fibonacci-heap priority-queue implementation. This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
16 lines
498 B
Makefile
16 lines
498 B
Makefile
# $NetBSD: Makefile,v 1.1.1.1 2006/05/03 05:17:48 minskim Exp $
|
|
|
|
DISTNAME= priority-queue-0.1.2
|
|
PKGNAME= ${RUBY_PKGPREFIX}-${DISTNAME}
|
|
CATEGORIES= devel
|
|
MASTER_SITES= http://ruby.brian-schroeder.de/priority-queue/releases/
|
|
EXTRACT_SUFX= .tar.bz2
|
|
|
|
MAINTAINER= minskim@NetBSD.org
|
|
HOMEPAGE= http://ruby.brian-schroeder.de/priority-queue/releases/
|
|
COMMENT= Fibonacci-heap priority-queue implementation for Ruby
|
|
|
|
USE_RUBY_SETUP= yes
|
|
|
|
.include "../../lang/ruby/modules.mk"
|
|
.include "../../mk/bsd.pkg.mk"
|