Using Prim Algorithm With The Adjoining Array
The adjoining array can be used as a "data structure" to represent graphs.So it is useful to see how the Prim Algorithm can be implemented using the adjoining array.This array is specified by the costs,which means A(i,j)=c(eij).When we don't use directed graphs this array is symmetrical.
The Prim algorithm steps are now :
In every step the Vk node become Vj 's child.
HTML PAGE DIRECTOR :Papaioannou Panagiotis