A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on arbitrary concrete representations of graphs. To attain this type of flexibility for graph data structures, which are more complicated than thedoi:10.1145/320384.320428 dblp:conf/oopsla/LeeSL99 fatcat:ronsmziiibbodbn4d3zey33eue