Spanning Tree for Digraph

Jayson Vantuyl <>
Fri Nov 13 00:48:09 CET 2009

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.


Jayson Vantuyl

More information about the erlang-questions mailing list