Branch and Bound

Dynamic Programming

Greedy Algorithms

Linear Programming

for i=1 to V[g]-1

          do for each edge (u,v) in E[g]

                   do Relax(u,v,w)

   return

True

for i=1 to V[g]-1

          do for each edge (u,v) in E[g]

                   do Relax(u,v,w)

   for

each edge (u,v) in E[g]

          do if d[v]>d[u]+w(u,v)

                   then

return False

   return

True

for i=1 to V[g]-1

          do for each edge (u,v) in E[g]

                   do Relax(u,v,w)

   for

each edge (u,v) in E[g]

          do if d[v]<d[u]+w(u,v)

                   then

return

   return

True

for i=1 to V[g]-1

       for

each edge (u,v) in E[g]

          do if d[v]>d[u]+w(u,v)

                   then

return False

    return

True