[jgrapht-users] minimum spanning tree using closestfirstiterator

[Christian M. <chr...@ig...>]

hey
as first i have to say that i have not much experience in java programming.
the problem is as follows:

i have a defaultdirectedweighted graph of the type 
<ThoughtSpaceVertex<Long,String,URL>,DefaultWeightedEdge>. I would like 
to get the minimum spanning tree of this graph and found that i would 
have to use the closestfirstiterator for this problem. can anybody help 
me how to use the iterator? maybe with a small code example?

thanks in advance
christian