Graph Template Library (GTL) is based on the Standart Template Library
(STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. GTL contains the classes needed to work with graphs, nodes and edges and some basic algorithms as building blocks for more complex graph algorithms. Further algorithms are under work. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
This commit is contained in:
reinhard
parent
e4ae05eaea
commit
e2204ecc2c
37
devel/gtl/Makefile
Normal file
37
devel/gtl/Makefile
Normal file
@ -0,0 +1,37 @@
|
||||
# $OpenBSD: Makefile,v 1.1.1.1 2001/01/19 16:33:15 reinhard Exp $
|
||||
|
||||
DISTNAME= GTL-0.3.3
|
||||
PKGNAME= gtl-0.3.3
|
||||
CATEGORIES= devel
|
||||
NEED_VERSION= 1.351
|
||||
|
||||
MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
|
||||
|
||||
LICENSE_TYPE= no-commercial-use
|
||||
PERMIT_PACKAGE_CDROM= "redistribution requires written permission"
|
||||
PERMIT_PACKAGE_FTP= "redistribution requires written permission"
|
||||
PERMIT_DISTFILES_CDROM= "redistribution requires written permission"
|
||||
PERMIT_DISTFILES_FTP= "redistribution requires written permission"
|
||||
|
||||
HOMEPAGE= http://infosun.fmi.uni-passau.de/GTL/
|
||||
|
||||
MASTER_SITES= ${HOMEPAGE}archive/
|
||||
|
||||
FAKE_FLAGS= PREFIX="${WRKINST}${PREFIX}"
|
||||
|
||||
CONFIGURE_STYLE= gnu
|
||||
MAKE_ENV+= GTL_VERS="0:3"
|
||||
|
||||
do-install:
|
||||
${INSTALL_DATA_DIR} ${PREFIX}/share/doc/gtl
|
||||
${INSTALL_DATA_DIR} ${PREFIX}/share/doc/gtl/icons
|
||||
${INSTALL_DATA} ${WRKSRC}/doc/html/*.html ${PREFIX}/share/doc/gtl
|
||||
${INSTALL_DATA} ${WRKSRC}/doc/html/icons/*.gif ${WRKSRC}/doc/html/icons/*.jpeg ${PREFIX}/share/doc/gtl/icons
|
||||
${INSTALL_DATA} ${WRKSRC}/README ${PREFIX}/share/doc/gtl
|
||||
${INSTALL_DATA_DIR} ${PREFIX}/include/GTL
|
||||
${INSTALL_DATA} ${WRKSRC}/include/GTL/*.h ${PREFIX}/include/GTL
|
||||
${INSTALL_DATA} ${WRKSRC}/src/libGTL.la ${PREFIX}/lib/libGTL.la
|
||||
${INSTALL_DATA} ${WRKSRC}/src/.libs/libGTL.so.0.3 ${PREFIX}/lib/libGTL.so.0.3
|
||||
${INSTALL_DATA} ${WRKSRC}/src/.libs/libGTL.a ${PREFIX}/lib/libGTL.a
|
||||
|
||||
.include <bsd.port.mk>
|
||||
3
devel/gtl/files/md5
Normal file
3
devel/gtl/files/md5
Normal file
@ -0,0 +1,3 @@
|
||||
MD5 (GTL-0.3.3.tar.gz) = 3fc4653715b8d3b32f9bee3f4ea01252
|
||||
RMD160 (GTL-0.3.3.tar.gz) = dbfa6b83cb975331db37a75caedd096a080c40df
|
||||
SHA1 (GTL-0.3.3.tar.gz) = 5cf7baab5ec299045fc9f8df455cb32be39cb736
|
||||
12
devel/gtl/patches/patch-src_Makefile_in
Normal file
12
devel/gtl/patches/patch-src_Makefile_in
Normal file
@ -0,0 +1,12 @@
|
||||
$OpenBSD: patch-src_Makefile_in,v 1.1.1.1 2001/01/19 16:33:15 reinhard Exp $
|
||||
--- src/Makefile.in.orig Tue Mar 7 09:14:07 2000
|
||||
+++ src/Makefile.in Thu Jan 11 18:21:23 2001
|
||||
@@ -92,7 +92,7 @@ lib_LTLIBRARIES = libGTL.la
|
||||
libGTL_la_SOURCES = gml_scanner.cpp gml_parser.cpp edge.cpp graph.cpp node.cpp dfs.cpp biconnectivity.cpp bfs.cpp topsort.cpp st_number.cpp embedding.cpp pq_node.cpp pq_tree.cpp planarity.cpp maxflow_ff.cpp maxflow_pp.cpp debug.cpp components.cpp fm_partition.cpp ratio_cut_partition.cpp
|
||||
|
||||
|
||||
-libGTL_la_LDFLAGS = -version-info $(MINOR_VERSION):$(MINI_VERSION):0
|
||||
+libGTL_la_LDFLAGS = -version-info $(GTL_VERS)
|
||||
mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
|
||||
CONFIG_CLEAN_FILES =
|
||||
LTLIBRARIES = $(lib_LTLIBRARIES)
|
||||
1
devel/gtl/pkg/COMMENT
Normal file
1
devel/gtl/pkg/COMMENT
Normal file
@ -0,0 +1 @@
|
||||
c++ graph data template library based on the stl
|
||||
15
devel/gtl/pkg/DESCR
Normal file
15
devel/gtl/pkg/DESCR
Normal file
@ -0,0 +1,15 @@
|
||||
Graph Template Library (GTL) is based on the Standart Template Library
|
||||
(STL), which is supposed to become a part of the C++ standart library
|
||||
and therefore is an ideal basis when writing portable programs.
|
||||
|
||||
For the design of the GTL's API the API of LEDA is used as a base. GTL
|
||||
contains the classes needed to work with graphs, nodes and edges and
|
||||
some basic algorithms as building blocks for more complex graph
|
||||
algorithms. Further algorithms are under work.
|
||||
|
||||
Unfortunately, STL has no support for graphs and graph algorithms.
|
||||
However, graphs are widely used to model complex relational
|
||||
structures.
|
||||
|
||||
WWW: ${HOMEPAGE}
|
||||
LICENSE: Redistribution/commerical use requires written permission
|
||||
5
devel/gtl/pkg/MESSAGE
Normal file
5
devel/gtl/pkg/MESSAGE
Normal file
@ -0,0 +1,5 @@
|
||||
+---------------
|
||||
| Commercial use of GTL without prior written permission is prohibited.
|
||||
| GTL must not be distributed without prior written permission. The terms
|
||||
| of this copyright notice also apply to any modification to this software.
|
||||
+---------------
|
||||
3
devel/gtl/pkg/PFRAG.shared
Normal file
3
devel/gtl/pkg/PFRAG.shared
Normal file
@ -0,0 +1,3 @@
|
||||
@comment $OpenBSD: PFRAG.shared,v 1.1.1.1 2001/01/19 16:33:15 reinhard Exp $
|
||||
lib/libGTL.so.0.3
|
||||
DYNLIBDIR(%D/lib)
|
||||
110
devel/gtl/pkg/PLIST
Normal file
110
devel/gtl/pkg/PLIST
Normal file
@ -0,0 +1,110 @@
|
||||
@comment $OpenBSD: PLIST,v 1.1.1.1 2001/01/19 16:33:15 reinhard Exp $
|
||||
include/GTL/GTL.h
|
||||
include/GTL/algorithm.h
|
||||
include/GTL/bfs.h
|
||||
include/GTL/biconnectivity.h
|
||||
include/GTL/components.h
|
||||
include/GTL/debug.h
|
||||
include/GTL/dfs.h
|
||||
include/GTL/edge.h
|
||||
include/GTL/edge_data.h
|
||||
include/GTL/edge_map.h
|
||||
include/GTL/embedding.h
|
||||
include/GTL/fm_partition.h
|
||||
include/GTL/gml_parser.h
|
||||
include/GTL/gml_scanner.h
|
||||
include/GTL/graph.h
|
||||
include/GTL/maxflow_ff.h
|
||||
include/GTL/maxflow_pp.h
|
||||
include/GTL/ne_map.h
|
||||
include/GTL/node.h
|
||||
include/GTL/node_data.h
|
||||
include/GTL/node_map.h
|
||||
include/GTL/planarity.h
|
||||
include/GTL/pq_node.h
|
||||
include/GTL/pq_tree.h
|
||||
include/GTL/ratio_cut_partition.h
|
||||
include/GTL/st_number.h
|
||||
include/GTL/symlist.h
|
||||
include/GTL/topsort.h
|
||||
include/GTL/version.h
|
||||
lib/libGTL.a
|
||||
lib/libGTL.la
|
||||
share/doc/gtl/GML_error.html
|
||||
share/doc/gtl/GTL-GTL-h.html
|
||||
share/doc/gtl/GTL-algorithm-h.html
|
||||
share/doc/gtl/GTL-bfs-h.html
|
||||
share/doc/gtl/GTL-biconnectivity-h.html
|
||||
share/doc/gtl/GTL-components-h.html
|
||||
share/doc/gtl/GTL-debug-h.html
|
||||
share/doc/gtl/GTL-dfs-h.html
|
||||
share/doc/gtl/GTL-edge-h.html
|
||||
share/doc/gtl/GTL-edge_data-h.html
|
||||
share/doc/gtl/GTL-edge_map-h.html
|
||||
share/doc/gtl/GTL-embedding-h.html
|
||||
share/doc/gtl/GTL-fm_partition-h.html
|
||||
share/doc/gtl/GTL-gml_parser-h.html
|
||||
share/doc/gtl/GTL-gml_scanner-h.html
|
||||
share/doc/gtl/GTL-graph-h.html
|
||||
share/doc/gtl/GTL-maxflow_ff-h.html
|
||||
share/doc/gtl/GTL-maxflow_pp-h.html
|
||||
share/doc/gtl/GTL-ne_map-h.html
|
||||
share/doc/gtl/GTL-node-h.html
|
||||
share/doc/gtl/GTL-node_data-h.html
|
||||
share/doc/gtl/GTL-node_map-h.html
|
||||
share/doc/gtl/GTL-planarity-h.html
|
||||
share/doc/gtl/GTL-pq_node-h.html
|
||||
share/doc/gtl/GTL-pq_tree-h.html
|
||||
share/doc/gtl/GTL-ratio_cut_partition-h.html
|
||||
share/doc/gtl/GTL-st_number-h.html
|
||||
share/doc/gtl/GTL-symlist-h.html
|
||||
share/doc/gtl/GTL-topsort-h.html
|
||||
share/doc/gtl/GTL-version-h.html
|
||||
share/doc/gtl/README
|
||||
share/doc/gtl/algorithm.html
|
||||
share/doc/gtl/bfs.html
|
||||
share/doc/gtl/biconnectivity.html
|
||||
share/doc/gtl/classes.html
|
||||
share/doc/gtl/components.html
|
||||
share/doc/gtl/dfs.html
|
||||
share/doc/gtl/doc000.html
|
||||
share/doc/gtl/doc001.html
|
||||
share/doc/gtl/doc002.html
|
||||
share/doc/gtl/doc003.html
|
||||
share/doc/gtl/doc004.html
|
||||
share/doc/gtl/doc005.html
|
||||
share/doc/gtl/doc006.html
|
||||
share/doc/gtl/doc007.html
|
||||
share/doc/gtl/edge.html
|
||||
share/doc/gtl/edge_map.html
|
||||
share/doc/gtl/fm_partition.html
|
||||
share/doc/gtl/graph.html
|
||||
share/doc/gtl/header-list.html
|
||||
share/doc/gtl/hier.html
|
||||
share/doc/gtl/icons/GTL-small.gif
|
||||
share/doc/gtl/icons/GTL.jpeg
|
||||
share/doc/gtl/icons/contents.gif
|
||||
share/doc/gtl/icons/next.gif
|
||||
share/doc/gtl/icons/next_gr.gif
|
||||
share/doc/gtl/icons/previous.gif
|
||||
share/doc/gtl/icons/previous_gr.gif
|
||||
share/doc/gtl/icons/up.gif
|
||||
share/doc/gtl/icons/up_gr.gif
|
||||
share/doc/gtl/index.html
|
||||
share/doc/gtl/maxflow_ff.html
|
||||
share/doc/gtl/maxflow_pp.html
|
||||
share/doc/gtl/ne_map.html
|
||||
share/doc/gtl/node.html
|
||||
share/doc/gtl/node_map.html
|
||||
share/doc/gtl/planar_embedding.html
|
||||
share/doc/gtl/planarity.html
|
||||
share/doc/gtl/pq_tree.html
|
||||
share/doc/gtl/ratio_cut_partition.html
|
||||
share/doc/gtl/refer.html
|
||||
share/doc/gtl/st_number.html
|
||||
share/doc/gtl/symlist.html
|
||||
share/doc/gtl/topsort.html
|
||||
%%SHARED%%
|
||||
@dirrm share/doc/gtl/icons
|
||||
@dirrm share/doc/gtl
|
||||
@dirrm include/GTL
|
||||
Loading…
x
Reference in New Issue
Block a user