Hi all,
After running Kruskal's algorithm I end up with the list of the edges
that form the minimum cost. However, no new graph is created. I need
the resulting graph for further computations. How do you create a graph
from an existing one but only selecting the edges contained in the
minimum spanning tree vector? I've seen that there are some functions
to accomplish this but I couldn't find any example of how to do it:
template