Finding the shortest path using bellmanford algorithm for weighted undirected graph

Question

I\'m using bellmanford algorithm to find the shortest distance and the path between two vertices, here is my code

import networkx as nx
import math

def Bellm