Morning: Dijkstra’s algorithm for shortest paths

In the morning we discussed Dijkstra’s algorithm for finding the shortest path between points on a weighted graph. Dijkstra’s algorithm

Afternoon: Travelling Salesperson problem

We used the following table: