HS Algorithm

PQ

1:<b, d(Q,b)>

2:<a, d(Q, a)>

PQ

1:<a, d(Q,a)>

2:<G, d(Q, G)>

3:<F, d(Q,F)>

4:<J, d(Q, J>

5:<H, d(Q, H)>

PQ

1:<D,d(Q,D)>

2:<G, d(Q, G)>

3:<F, d(Q,F)>

4:<J, d(Q, J>

5:<B, d(Q, B)>

6:<C, d(Q,C)>

7:<H, d(Q, H)>

8:<A, d(Q, A)>

Space usage = O(number of items) = O(n)

Previous slide

Next slide

Back to first slide

View graphic version