683 views
1 votes
1 votes

From Wikipedia :

the algorithm requires

\Theta ((|E|+|V|)\log |V|)

time in the worst case;

for connected graphs this time bound can be simplified to \Theta (|E|\log |V|)

1. Can somebody explain how are we combing (V+E) into E in case of connected graph and why it can't be combined in case of disconnected graph?

2. What will be dijakstra behaviour for disconnected graph?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Elaf asked Jan 22, 2023
310 views
0 votes
0 votes
0 answers
3
gate20232 asked Jan 18, 2023
444 views
2 votes
2 votes
1 answer
4