Practice Algorithms - GATE - CSIT, DSAI & Interview Preparation Offered by Unacademy

Algorithms

Consider the following directed graph.

Print the sequence of vertices identified by Dijkstra ( in the order of 'vertices deleted from the min heap' ) when started from vertex A.

$\mathrm{A} \rightarrow \mathrm{B} \rightarrow \mathrm{D} \rightarrow \mathrm{C} \rightarrow \mathrm{E} \rightarrow \mathrm{F}$

$A \rightarrow B \rightarrow D \rightarrow C \rightarrow F \rightarrow E$

$\mathrm{A} \rightarrow \mathrm{B} \rightarrow \mathrm{C} \rightarrow \mathrm{D} \rightarrow \mathrm{F} \rightarrow \mathrm{E}$

$A \rightarrow B \rightarrow C \rightarrow D \rightarrow E \rightarrow E$