Hi,
I need to find all minimum spanning trees of an unweighted graph.
Is there a way in R to do that?
Thanks
--
View this message in context:
http://n4.nabble.com/Minimum-Spanning-Trees-tp1569351p1569351.html
Sent from the R help mailing list archive at Nabble.com.
__
Hi,
On Thu, Feb 25, 2010 at 12:16 PM, harunpirim wrote:
>
> Hi,
>
> I need to find all minimum spanning trees of an unweighted graph.
> Is there a way in R to do that?
If you're working with graphs in R, you'll probably want to see what
the igraph library has to offer. For instance, it has a
"mi
2 matches
Mail list logo