Yes, my case is undirected graphs (with my own TVertex and TEdge classes), and I need to save/load whole dataset to text/xml (both structure and objects).
Also I need to visualize it in form of "circles connected by lines", so I guess DistinctEdges is what I need.
Currently, I'm using another graph library (C-code linked to my Pascal project), but found your one, and evaluating it. It's very complex, not yet get used to it.
Also, does DistinctEdges return cached value, or does it recalculate list on the fly (from adjacency matrix?)?