Graphs are a common model for discrete relational structures, such as diagrams, nets and networks, hierarchies, plans, charts, or maps. And there are many important algorithms for graphs, such us exhaustive search, shortest path, minimum spanning tree, matching or network flow, with a wide range of applications in areas such as Computer Science, Discrete Mathematics, Chemistry, Molecular Biology, Operations Research, Engineering, Computer Aided Design, Project Management, Production Planning, Surveillance, and Maintenance Control, Cartography, and other application areas. The wide use of graphs is also due to the fact that they have a natural graphical representation and Graphlet is a tool for this. It is a useful aid to any software designer. GTL contains the classes needed to work with graphs, nodes and edges and some fundamental algorithms as building blocks for more complex graph algorithms.
Further algorithms are under development.
Customized algorithms can be developed by experienced programmers. A major step shall be support for models of hierarchically structured graph and the efficient manipulation of really large graphs. To receive an impression what GTL is good for and what people think about it, please have a look at the projects it is employed. Authors Mailing-lists License Version History News Download Policy changed. Access to the download archive of GTL limited.