title: Minimal Spanning Tree of Distance Matrix (preferable numpy)
body: <p>Lets assume we have a complete <strong>directed</strong> Graph and we want to calculate the Minimal Spanning tree by its Distance Matrix. Is there a efficient algorithm without involving packages from graphtheory? Might this be an application of neural networks?</p>