Has anyone created a graph adapter to make a bidirectional graph appear as an undirected graph? If not, is the difficulty in making an edge iterator across both the in and out links? I particular I would like to compute a weak connected components on a bidirectional graph. So if you have a modified connected components alg for that it would be great. Thanks, Joel