MST algorithm for Multi Graph

Hi,

I hope that this is the correct forum for this question, if not I ask for your forgiveness.
I need to find the Minimal Spanning Tree, on a Multi Graph,
I'm using Java in Eclipse enviroment.

Any idea?

Thanks in advance
Avi

Of all edges between two given nodes you need the shortest, discard all other edges. After that you'll have to implement minimum spanning tree on ordinary graph, you can find algorithms for that anywhere.
http://en.wikipedia.org/wiki/Prim%27s_algorithm
http://en.wikipedia.org/wiki/Kruskal%27s_algorithm
Refer external links in Wikipedia articles - there are implementations there.