Draw the graph and apply the single source shortest path algorithm (Bellman Ford), A is the source for the shortest path calculation. You have to show all the updated vertex weights and their parent selection after every complete update of all the edges.

You should consider all the edges in the alphabetical order. Show after every pass update.

Vertex Relations A B(2), C(2) B E(-3), G(8), F(4) C B(1), E(-2) D C(10), G(2) E G(2), D(2) F E(1), B(2) G B(-3), A(2)