Write a code for Prims Algorithm to find the minimum spanning tree in a weighted graph using Java

here is the pseudocode:

Algorithm PrimJarnik(G): Input: An undirected, weighted, connected graph G with n vertices and medges Output: A minimum spanning tree T for G Pick any vertex s of G D[ ] = 0 for each vertex v s do Initialize T-0. Initialize a priority queue Q with an entry (D[v,v) for each vertex v. For each vertex v, maintain connect(v) as the edge achieving D[v] (if any). while Q is not empty do Let u be the value of the entry returned by Q.removeMin) Connect vertex u to T using edge connect(e) for each edge e' = (u, v) such that v is in Q do check if edge (u,v) better connects v to T if w(u, v)