Spanning Tree Algorithm

ST(i: vertex)

mark i;

for each j adjacent to i do

if j is unmarked then

Add {i,j} to T;

ST(j);

end{ST}

Main

T := empty set;

ST(1);

end{Main}

Previous slide

Next slide

Back to first slide

View graphic version