forked from Lainports/freebsd-ports
7883ac7a42
TSort implements topological sorting using Tarjan's algorithm for strongly connected components. TSort is designed to be able to be used with any object which can be interpreted as a directed graph. TSort requires two methods to interpret an object as a graph, tsort_each_node and tsort_each_child: - tsort_each_node is used to iterate for all nodes over a graph. - tsort_each_child is used to iterate for child nodes of a given node. The equality of nodes are defined by eql? and hash since TSort uses Hash internally. WWW: https://github.com/ruby/tsort
21 lines
385 B
Makefile
21 lines
385 B
Makefile
# Created by: Po-Chuan Hsieh <sunpoet@FreeBSD.org>
|
|
# $FreeBSD$
|
|
|
|
PORTNAME= tsort
|
|
PORTVERSION= 0.1.0
|
|
CATEGORIES= devel rubygems
|
|
MASTER_SITES= RG
|
|
|
|
MAINTAINER= sunpoet@FreeBSD.org
|
|
COMMENT= Topological sorting using Tarjan's algorithm
|
|
|
|
LICENSE= BSD2CLAUSE RUBY
|
|
LICENSE_COMB= dual
|
|
LICENSE_FILE_BSD2CLAUSE=${WRKSRC}/LICENSE.txt
|
|
|
|
USES= gem
|
|
USE_RUBY= yes
|
|
|
|
NO_ARCH= yes
|
|
|
|
.include <bsd.port.mk>
|