1.

Consider the following undirected graph:

Trace Dijkstra’s algorithm to calculate the single source paths from A to every other
vertices.

2. Consider the following graph:

Three boys walk to school at location J from their home at A,B,C. The diagram shows the
network of the roads with the distance on the arcs. Using Dijkstra’s algorithm, find out who
among (A,B,C) lives near to school.