結果 : compute a minimum cost spanning tree for the graph using prim's algorithm with example