[Lemon-user] number of STATE_TREE vars at end of network simplex (on connected graph)

[Matthew Galati]

> See the kruskal doc for more details
>
> http://lemon.cs.elte.hu/pub/doc/1.1.2/a00443.html#ga0b63cab19a2f168772a13d7c59449eb
>
>
I am not planning on using it - since the graph I construct will be
undirected, but I noticed that in Kruskal's code there is a section for
directed graphs. I was not aware that Kruskal's can find a MST on a directed
graph. Is the algorithm correct for directed graphs?

Thanks,
Matt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20100309/9c45b79f/attachment.html>