Updated by FastRunner on Monday, February 04th 2008.
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 (included are planarity test and two maximum flow algorithms).
Has tapped premier talent in the Internet industry for our content and each and every issue will contain practical advice and insights for website owners.