pkgsrc/devel/gtl0/PLIST
wiz 49dab3315c Re-import gtl as gtl0, since this (older) version is needed for
math/cassowary and I'll update gtl in a minute.

DESCR:
GTL is a graph library based on STL.  For the design of GTL's API the
API of LEDA has served as a basis.  GTL contains the classes needed to
work with graphs, nodes and edges and some basic algorithms (DFS, BFS,
topsort ...) as building blocks for more complex graph algorithms.

This package contains an older version of the library, for a newer
version use the gtl package.
2004-11-02 20:32:37 +00:00

107 lines
3.3 KiB
Text

@comment $NetBSD: PLIST,v 1.1.1.1 2004/11/02 20:32:37 wiz 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.la
share/doc/html/GTL/GML_error.html
share/doc/html/GTL/GTL-GTL-h.html
share/doc/html/GTL/GTL-algorithm-h.html
share/doc/html/GTL/GTL-bfs-h.html
share/doc/html/GTL/GTL-biconnectivity-h.html
share/doc/html/GTL/GTL-components-h.html
share/doc/html/GTL/GTL-debug-h.html
share/doc/html/GTL/GTL-dfs-h.html
share/doc/html/GTL/GTL-edge-h.html
share/doc/html/GTL/GTL-edge_data-h.html
share/doc/html/GTL/GTL-edge_map-h.html
share/doc/html/GTL/GTL-embedding-h.html
share/doc/html/GTL/GTL-fm_partition-h.html
share/doc/html/GTL/GTL-gml_parser-h.html
share/doc/html/GTL/GTL-gml_scanner-h.html
share/doc/html/GTL/GTL-graph-h.html
share/doc/html/GTL/GTL-maxflow_ff-h.html
share/doc/html/GTL/GTL-maxflow_pp-h.html
share/doc/html/GTL/GTL-ne_map-h.html
share/doc/html/GTL/GTL-node-h.html
share/doc/html/GTL/GTL-node_data-h.html
share/doc/html/GTL/GTL-node_map-h.html
share/doc/html/GTL/GTL-planarity-h.html
share/doc/html/GTL/GTL-pq_node-h.html
share/doc/html/GTL/GTL-pq_tree-h.html
share/doc/html/GTL/GTL-ratio_cut_partition-h.html
share/doc/html/GTL/GTL-st_number-h.html
share/doc/html/GTL/GTL-symlist-h.html
share/doc/html/GTL/GTL-topsort-h.html
share/doc/html/GTL/GTL-version-h.html
share/doc/html/GTL/algorithm.html
share/doc/html/GTL/bfs.html
share/doc/html/GTL/biconnectivity.html
share/doc/html/GTL/classes.html
share/doc/html/GTL/components.html
share/doc/html/GTL/dfs.html
share/doc/html/GTL/doc000.html
share/doc/html/GTL/doc001.html
share/doc/html/GTL/doc002.html
share/doc/html/GTL/doc003.html
share/doc/html/GTL/doc004.html
share/doc/html/GTL/doc005.html
share/doc/html/GTL/doc006.html
share/doc/html/GTL/doc007.html
share/doc/html/GTL/edge.html
share/doc/html/GTL/edge_map.html
share/doc/html/GTL/fm_partition.html
share/doc/html/GTL/graph.html
share/doc/html/GTL/header-list.html
share/doc/html/GTL/hier.html
share/doc/html/GTL/icons/GTL-small.gif
share/doc/html/GTL/icons/GTL.jpeg
share/doc/html/GTL/icons/contents.gif
share/doc/html/GTL/icons/next.gif
share/doc/html/GTL/icons/next_gr.gif
share/doc/html/GTL/icons/previous.gif
share/doc/html/GTL/icons/previous_gr.gif
share/doc/html/GTL/icons/up.gif
share/doc/html/GTL/icons/up_gr.gif
share/doc/html/GTL/index.html
share/doc/html/GTL/maxflow_ff.html
share/doc/html/GTL/maxflow_pp.html
share/doc/html/GTL/ne_map.html
share/doc/html/GTL/node.html
share/doc/html/GTL/node_map.html
share/doc/html/GTL/planar_embedding.html
share/doc/html/GTL/planarity.html
share/doc/html/GTL/pq_tree.html
share/doc/html/GTL/ratio_cut_partition.html
share/doc/html/GTL/refer.html
share/doc/html/GTL/st_number.html
share/doc/html/GTL/symlist.html
share/doc/html/GTL/topsort.html
@dirrm share/doc/html/GTL/icons
@dirrm share/doc/html/GTL
@dirrm include/GTL