R - minimum.spanning.tree() - Kruskal's algorithm

Asked by viktor frankenstein

How can i use Kruskal's algorithm for calculating minimum spanning tree?

If where is no way with named function consider it as feture request.

So i can use and plot in the same way as Prim's algorithm like this:

mst <- minimum.spanning.tree(g, algorithm = "prim")
plot(mst)

Question information

Language:
English Edit question
Status:
Answered
For:
igraph Edit question
Assignee:
No assignee Edit question
Last query:
Last reply:
Revision history for this message
Gábor Csárdi (gabor.csardi) said :
#1

First of all note that igraph development is on github now. http://github.com/igraph/igraph

As for your question, why does one need Kruskal's algorithm instead of Prim's?

Revision history for this message
viktor frankenstein (frankenstein) said :
#2

Should i post same question on github?

For exsample to compare both algorithms wich perform better. When choose better performing alogorithm. Thet both common algorithms.

Revision history for this message
Gábor Csárdi (gabor.csardi) said :
#3

Then please post a bug report on github. Thanks.

Can you help with this problem?

Provide an answer of your own, or ask viktor frankenstein for more information if necessary.

To post a message you must log in.