test the code using this graph

Problem 5: Baggage Allowance - There are n airports in the given country. For every i and j we know the baggage allowance on the flights from i-th to j-th airport. - Write the Python code that for a given starting u and for all other airports v finds the maximal weight that can be transported from u to v. You can use as many intermediate stops as necessary. The total time of the algorithm should be O(n2). - Test the code using the graph obtained in Problem 4 , i.e. the graph after re-weighting. Hint: Modify the Dijkstra's algorithm. def main( ): graph = Graph (5) graph.add_edge (0,1,5) graph.add_edge (1,0,6) graph.add_edge (0,3,1) graph.add_edge (0,2,5) graph.add_edge (0,4,2) graph.add_edge (4,2,1) graph.add_edge (2,3,2) graph.add_edge (3,4,1)