popular algorithms in computer science. It is also popular in operations research.It is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph.
Travelling salesman problem
Given a list of cities with the distance
between each pair of cities the salesman has to deliver the products to each city exactly once and return back to his origin point.