analyzing the prim-jarnik algorithm the implementation issues for the prim-jarnik algorithm are similar to those for dijkstra' algorithmrelying on an adaptable priority queue (section we initially perform insertions into qlater perform extract-min operationsand may update total of priorities as part of the algorithm those steps are the primary contributions to the overall running time with heap-based priority queueeach operation runs in (log ntimeand the overall time for the algorithm is (( mlog )which is ( log nfor connected graph alternativelywe can achieve ( running time by using an unsorted list as priority queue illustrating the prim-jarnik algorithm we illustrate the prim-jarnik algorithm in figures through bos ord bwi lax mia bos ord jfk bwi mia ( dfw lax pvd jfk sfo dfw lax pvd bos ord bwi ( sfo ( jfk mia dfw pvd sfo dfw lax ord jfk sfo pvd bos bwi mia (dfigure an illustration of the prim-jarnik mst algorithmstarting with vertex pvd (continues in figure