Do you know of python extentions that implement efficient graph algorithms? In particular I am interested in minimising the number of nodes & arcs used for representing directed graphs. If you know of implementations in other languages than python - e.g. C/C++, I am interested as well. Cheers Jesper