Print

Print


*****  To join INSNA, visit http://www.insna.org  *****

Kruskal and spanning dag/forest are also implemented in Tulip, which
handles rather large networks.
You can work it in python as well: http://tulip.labri.fr/TulipDrupal/


--
Benjamin


On 14 April 2014 17:36, Alexei Kireyev <[log in to unmask]> wrote:

> ***** To join INSNA, visit http://www.insna.org *****
> Dear colleagues,
> I need to calculate and visualize the minimum spanning tree (MST) in a
> relatively complex valued directed network. Does anybody know which
> software can do it?
> Many thanks,
> Alexei
>  _____________________________________________________________________
> SOCNET is a service of INSNA, the professional association for social
> network researchers (http://www.insna.org). To unsubscribe, send an email
> message to [log in to unmask] containing the line UNSUBSCRIBE SOCNET
> in the body of the message.

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.