Algorithms

1. Run Dijkstra's algorithm on the following graph starting from v . Does Dijkstra's algorithm work correctly with graphs with negative weight edges? 2. Run Dijkstra's algorithm on the graph starting from A. a) List the nodes in the order of their removal from the queue. b) Fill table like the following table d[v] P[V] 0 H 1. Run Dijkstra's algorithm on the following graph starting from v . Does Dijkstra's algorithm work correctly with graphs with negative weight edges? 2. Run Dijkstra's algorithm on the graph starting from A. a) List the nodes in the order of their removal from the queue. b) Fill table like the following table d[v] P[V] 0 H