Algoritmo di Edmonds: differenze tra le versioni

Versione delle 14:55, 28 dic 2016

Versione delle 19:03, 4 feb 2018

Riga 136:

== Collegamenti esterni ==

*[http://www.ce.rit.edu/~sjyeec/dmst.html The Directed Minimum Spanning Tree Problem] Description of the algorithm summarized by Shanchieh Jay Yang, May 2000.

*[http://edmonds-alg.sourceforge.net/ Edmonds's algorithm ( edmonds-alg )] - An [[open source]] implementation of Edmonds's algorithm written in [[C++]] and licensed under the [[MIT License]]. This source is using Tarjan's implementation for the dense graph.

*[http://algowiki.net/wiki/index.php/Edmonds%27s_algorithm AlgoWiki - Edmonds's algorithm] - A public-___domain implementation of Edmonds's algorithm written in [[Java (linguaggio di programmazione)|Java]].