Warning, /JETSCAPE/external_packages/gtl/README is written in an unsupported language. File is not indexed.
0001 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
0002
0003 The Graph Template Library - GTL
0004
0005 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
0006
0007 PLEASE READ THE FILE 'COPYING' BEFORE APPLYING AND USING THIS SOFTWARE
0008
0009 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
0010
0011
0012 ABOUT GTL
0013
0014 GTL, the "Graph Template Library", can be seen as an
0015 extension of the Standard Template Library STL to graphs and
0016 fundamental graph algorithms.
0017
0018 Graphs are a common model for discrete relational structures,
0019 such as diagrams, nets and networks, hierarchies, plans,
0020 charts, or maps. And there are many important algorithms for
0021 graphs, such us exhaustive search, shortest path, minimum
0022 spanning tree, matching or network flow, with a wide range of
0023 applications in areas such as Computer Science, Discrete
0024 Mathematics, Chemistry, Molecular Biology, Operations
0025 Research, Engineering, Computer Aided Design, Project
0026 Management, Production Planning, Surveillance, and Maintenance
0027 Control, Cartography, and other application areas. The wide
0028 use of graphs is also due to the fact that they have a natural
0029 graphical representation and Graphlet is a tool for this.
0030
0031 GTL is a platform independent and extendible C++ library. It
0032 is a useful aid to any software designer. GTL contains the
0033 classes needed to work with graphs, nodes and edges and some
0034 fundamental algorithms as building blocks for more complex
0035 graph algorithms. Further algorithms are under development.
0036
0037 Customized algorithms can be developed by experienced
0038 programmers. A major step shall be support for models of
0039 hierachically structured graph and the efficient manipulation
0040 of really large graphs.
0041
0042 GTL has been designed and programmed following the guide lines
0043 of STL.
0044
0045
0046 WHAT IS GTL?
0047
0048 There are some basic data structures and algorithms which are frequently
0049 used in many programs. This includes container classes such as vectors,
0050 sets and lists.
0051
0052 Many commercial but some free libraries have implemented these data
0053 structures and algorithms in a general way. This makes them usable for
0054 many puposes.
0055
0056 One of these libraries is the Standard Template Library (STL), an
0057 extremely flexible implementation of many container classes and standard
0058 algorithms. STL is supposed to become a part of the C++ standard library
0059 and therefore is an ideal basis when writing portable programs.
0060
0061 Unfortunately, STL has no support for graphs and graph algorithms.
0062 However, graphs are widely used to model complex relational structures.
0063
0064 Since we are intensively working with graph algorithms especially
0065 in Graphlet (http://www.fmi.uni-passau.de/Graphlet/), we decided to
0066 implement GTL, a graph library based on STL. For the design of
0067 GTL's API bases on the API of LEDA. GTL contains the classes
0068 needed to work with graphs, nodes and edges and some basic
0069 algorithms as building blocks for more complex graph
0070 algorithms. Further algorithms are under work.
0071
0072
0073 VERSION:
0074
0075 The most recent version is 1.2.2.
0076
0077 For the changes since the last release 1.2.1 please see the
0078 ChangeLog and NEWS files.
0079
0080
0081 PLATFORMS:
0082
0083 We are currently using GTL in Graphlet on the following platforms:
0084
0085 * Solaris with gcc-3.x
0086 * Linux with gcc-3.x
0087 * MS Windows XP and Visual Studio .NET 2003
0088 * Mac OS X 10.2, 10.3
0089
0090 HOMEPAGE:
0091
0092 Please refer to our homepage
0093
0094 http://www.infosun.fmi.uni-passau.de/GTL
0095
0096 for updates and latest news.
0097
0098
0099 AUTHORS:
0100
0101 GTL was designed and implemented by
0102
0103 Michael Forster <forster@fmi.uni-passau.de>
0104 Andreas Pick <pick@fmi.uni-passau.de>
0105 Marcus Raitner <raitner@fmi.uni-passau.de>
0106
0107 Acknowledgements to
0108
0109 Christian Bachmaier <chris@infosun.fmi.uni-passau.de>
0110
0111
0112 BUGS AND FEATURES:
0113
0114 If you want to report any bugs in GTL or you have suggestions
0115 concerning desirable feature. Please let us know !
0116
0117 We maintain mailing-lists for all these purposes. The
0118 following lists are available:
0119
0120 gtl@infosun.fmi.uni-passau.de
0121 =============================
0122 Comments an questions about GTL to the GTL Team
0123
0124 gtl-bugs@infosun.fmi.uni-passau.de
0125 ==================================
0126 Bug Reports
0127
0128 gtl-users@infosun.fmi.uni-passau.de
0129 ===================================
0130 General Discussion about GTL
0131
0132 gtl-announce@infosun.fmi.uni-passau.de
0133 ======================================
0134 Low traffic, read only list for announcements of new GTL
0135 versions.
0136
0137
0138 You can subscribe to the the gtl-announce or gtl-users list by
0139 sending mail to
0140
0141 gtl-announce-request@infosun.fmi.uni-passau.de or
0142 gtl-users-request@infosun.fmi.uni-passau.de
0143
0144 with the single word "subscribe" in the body of the message.
0145
0146 All announcements on the gtl-announce list are forwarded to
0147 the gtl-users list, so there is no need to subscribe to both.
0148
0149 Please send bugreports and/or suggestions to the appropriate list
0150
0151 Always include the following informations in your bugreports:
0152
0153 * Operating System / Version (+ Service Pack)
0154 * Compiler / Version (+ Service Pack)
0155 * GTL version
0156 * A detailed description of the bug
0157 * Any warnings or errors you get.
0158 * output of make
0159 * the file config.log
0160 * $20 :-)
0161
0162
