Figure 2: Performance comparison of the BFS algorithm in GGCL with that in LEDA and GTL. Every curve represents a graph with a fixed number of vertices and with a varied number of edges.