what method to be used to find the MST in a directed graph (e.g.: http://upload.wikimedia.org/wikipedi...mantic_Net.svg) when there are vertices that has no entering edges?

Thanks.

Printable View

- 01-11-2012, 08:15 PMdacoolesthow to find MST in a directed graph?
what method to be used to find the MST in a directed graph (e.g.: http://upload.wikimedia.org/wikipedi...mantic_Net.svg) when there are vertices that has no entering edges?

Thanks. - 01-11-2012, 08:42 PMJosAHRe: how to find MST in a directed graph?
A minimal spanning tree is defined for an undirected graph (with weights on the edges), but how is such a tree defined for a directed graph?

kind regards,

Jos