What's the easiest way to get a minimum spanning tree for the digraph module? I couldn't find anything in the docs. While Icould write the algorithm myself, I figured it had to be out there somewhere. Thanks, -- Jayson Vantuyl kagato@REDACTED