Please provide complete python code using numpy Bell mailFor

Please provide complete python code using numpy

Bell mail-Ford algorithm is for finding the shortest path in a graph. Create a tile qG-3.py and using numpy and reduce operation, write a function bellman _ford which a is a n times n adjacency matrix of a directed weighted graph with n vertices. The function should return a list containing the shortest path from the first node to all nodes.

Solution

import os
file = open(os.path.dirname(os.path.realpath(__file__)) + \"/q3-5.py\")
vertices, edges = map(lambda x: int(x), file.readline().replace(\"\ \", \"\").split(\" \"))

adjacency_list = [[] for k in xrange(vertices)]
for line in file.readlines():
tail, head, weight = line.split(\" \")
adjacency_list[int(head)-1].append({\"from\" : int(tail), \"weight\" : int(weight)})

s=0
cache = [[0 for k in xrange(vertices+1)] for j in xrange(vertices+1)]
cache[0][s] = 0

for v in range(0, vertices):
if v != s:
cache[0][v] = float(\"inf\")

for i in range(1, vertices):
for v in range(0, vertices):
least_adjacent_cost = calculate_least_adjacent_cost(adjacency_list, i, v, cache[i-1])
cache[i][v] = min(cache[i-1][v], least_adjacent_cost)

# detecting negative cycles
for v in range(0, vertices):
least_adjacent_cost = calculate_least_adjacent_cost(adjacency_list, i, v, cache[vertices-1])
cache[vertices][v] = min(cache[vertices-1][v], least_adjacent_cost)

if(not cache[vertices] == cache[vertices-1]):
raise Exception(\"negative cycle detected\")

shortest_path = min(cache[vertices-1])
print(\"Shortest Path: \" + str(shortest_path))

def calculate_least_adjacent_cost(adjacency_list, i, v, cache):
adjacent_nodes = adjacency_list[v]

least_adjacent_cost = float(\"inf\")
for node in adjacent_nodes:
adjacent_cost = cache[node[\"from\"]-1] + node[\"weight\"]
if adjacent_cost < least_adjacent_cost:
least_adjacent_cost = adjacent_cost
return least_adjacent_cost
def bellman_ford(a):
   adjacent_node=adjancy_list[v]
for node in adjacent_nodes:
shortest_path= cache[node[\"from\"]-1] + node[\"weight\"]

return shortest_path