Warehouse Delivery Times

Problem Statement

Warehouse Delivery Times Problem A logistics company operates in a city that has several locations connected by roads. Every road has a travel time associated with it. Every day a delivery truck starts from a warehouse and wants to deliver packages to all other locations in the shortest possible time. If a location can be reached from the warehouse, the delivery truck will take the minimum travel time route to it. If a location cannot be reached at all, it is considered unreachable. You are given the list of road connections along with their travel times. Your task is to determine the minimum travel time required to reach every location from the warehouse. Roads can be driven in both directions , and the same pair of locations may be joined by more than one road. Input Format The first line contains the integer n , the total number of locations. The second line contains the integer mrows , the number of roads. The third line contains the integer mcolumns , representing the number of in