A) Starting from S/trace the operations of the Dijkstra's weighted shortest path algorithm on th

So from that graph we can say that a list of vertices that will be visited by running a breath f

Okay, here I want to use Kruskal's algorithm to work out the value of the minimum spanning tree.

So, according to our first part, we need to write first the all paths from S to T. So, first we

Hello students here we need to go from A to F. So we will assign infinity to all vertices except

According to the graph the output is the length of shortest distance and shortest path from 0 to

Question

A) Starting from S/trace the operations of the Dijkstra's weighted shortest path algorithm on the graph given in Figure 1. 2 E 1 3 2 2 A 3 1 2 2 1 S B D 3 2 4 C 1 2 F G Figure 1: A directed weighted graph. B) Starting from S trace the operations of the Prim's minimum spanning tree algorithm on the graph given in Figure 1. C) Trace the operations of Kruskal's minimum spanning tree algorithm on the graph given in Figure 1. D) Starting from S trace the operations of breadth-first traversal on the graph given in Figure 1. E) Given Figure 1 and starting from S, a) Trace the operations of depth-first traversal. b) Give the post-order numbers for all the nodes. c) Give the pre-order numbers for all the nodes. d) List the tree arcs, cross arcs, forward arcs, and backward arcs. F) Find a topological ordering of the graph given in Figure 2. B E A D C F Figure 2. An example DAG G

          A) Starting from S/trace the operations of the Dijkstra's weighted shortest path algorithm on the
graph given in Figure 1.
2
E
1
3
2
2
A
3
1
2
2
1
S
B
D
3
2
4
C
1
2
F
G
Figure 1: A directed weighted graph.
B) Starting from S trace the operations of the Prim's minimum spanning tree algorithm on the
graph given in Figure 1.
C) Trace the operations of Kruskal's minimum spanning tree algorithm on the graph given in
Figure 1.
D) Starting from S trace the operations of breadth-first traversal on the graph given in Figure 1.
E) Given Figure 1 and starting from S,
a) Trace the operations of depth-first traversal.
b) Give the post-order numbers for all the nodes.
c) Give the pre-order numbers for all the nodes.
d) List the tree arcs, cross arcs, forward arcs, and backward arcs.
F) Find a topological ordering of the graph given in Figure 2.
B
E
A
D
C
F
Figure 2. An example DAG
G

A) Starting from S/trace the operations of the Dijkstra's weighted shortest path algorithm on the
graph given in Figure 1.
2
E
1
3
2
2
A
3
1
2
2
1
S
B
D
3
2
4
C
1
2
F
G
Figure 1: A directed weighted graph.
B) Starting from S trace the operations of the Prim's minimum spanning tree algorithm on the
graph given in Figure 1.
C) Trace the operations of Kruskal's minimum spanning tree algorithm on the graph given in
Figure 1.
D) Starting from S trace the operations of breadth-first traversal on the graph given in Figure 1.
E) Given Figure 1 and starting from S,
a) Trace the operations of depth-first traversal.
b) Give the post-order numbers for all the nodes.
c) Give the pre-order numbers for all the nodes.
d) List the tree arcs, cross arcs, forward arcs, and backward arcs.
F) Find a topological ordering of the graph given in Figure 2.
B
E
A
D
C
F
Figure 2. An example DAG
G

Added by Michele C.

Question

Please give Ace some feedback