How to find minimum spanning tree in complete directed graph?

I have added weight of incoming and outgoing edges for every pair of vertexes in graph and used as an undirected edge .Then I use prim algorithm to find minimum spanning tree .It possible or not?