A company sells its products at N outlets. All the outlets are connected to each other by a series of roads. There is only one way to reach from one outlet to another. Each outlet of the company has a unique outlet ID. Whenever the inventory of a certain product reaches a minimum limit, then these K outlets make a request for extra inventory. The company sends the requested products from its warehouse to the outlets. In order to save on fuel, the warehouse supervisor directs the driver to deliver the products to the outlets along the shortest and most direct path possible, without traveling any single road twice.
Write an algorithm to help the driver deliver the inventory to the maximum number of outlets without traveling any road twice.