be4959a550
The Stanford GraphBase is a highly portable collection of programs and data for researchers who study combinatorial algorithms and data structures. All files are in the public domain and usable with only one restriction: They must not be changed! A ``change file'' mechanism allows local customization while the master files stay intact. The programs are intended to be interesting in themselves as examples of ``literate programming.'' Thus, the Stanford GraphBase can also be regarded as a collection of approximately 30 essays for programmers to enjoy reading, whether or not they are doing algorithmic research. The programs are written in CWEB, a combination of TeX and C that is easy to use by anyone who knows those languages and easy to read by anyone familiar with the rudiments of C.
18 lines
481 B
Makefile
18 lines
481 B
Makefile
# $NetBSD: buildlink3.mk,v 1.1.1.1 2006/05/04 09:35:33 minskim Exp $
|
|
|
|
BUILDLINK_DEPTH:= ${BUILDLINK_DEPTH}+
|
|
SGB_BUILDLINK3_MK:= ${SGB_BUILDLINK3_MK}+
|
|
|
|
.if !empty(BUILDLINK_DEPTH:M+)
|
|
BUILDLINK_DEPENDS+= sgb
|
|
.endif
|
|
|
|
BUILDLINK_PACKAGES:= ${BUILDLINK_PACKAGES:Nsgb}
|
|
BUILDLINK_PACKAGES+= sgb
|
|
|
|
.if !empty(SGB_BUILDLINK3_MK:M+)
|
|
BUILDLINK_API_DEPENDS.sgb+= sgb>=0pre20050409
|
|
BUILDLINK_PKGSRCDIR.sgb?= ../../devel/sgb
|
|
.endif # SGB_BUILDLINK3_MK
|
|
|
|
BUILDLINK_DEPTH:= ${BUILDLINK_DEPTH:S/+$//}
|