next up previous
Next: Modified Prim's Algorithm Up: PRIM-DIJKSTRA'S MST ALGORITHM Previous: PRIM-DIJKSTRA'S MST ALGORITHM

Data Structure for Prim's Algorithm

tex2html_wrap_inline378
NEAR[i]= 0 if tex2html_wrap_inline382
else = j if w(i,j) is minimum among all tex2html_wrap_inline388

figure82

NEAR[i]=j
NEAR[j]=0
NEAR[l]=0


Sushil Prasad
Thu Nov 4 14:09:59 EST 1999