Shortest Path Problem: find the path between a given pair of vertices such

that the sum of the wights for this path is less than that for any other path

between the vertices.

Chinese Postman Problem: find the shortest closed path that visits all the

vertices.

Travelling Salesman Problem: find the shortest closed path that visits all the

vertices once only.

ZB