TIme comlexity doubt

#1

in this problem shouldn’t the time complexity be (E + ELogV) and not VELogV as we will try flight for each edge?

#2

hello @shresthdewan
both are correct because O(E+ELOGV) Is equivalent to o(elogv)
so u can any use any of them.

#3

in the video it is (v*eLogv)

#4

For the brute force method where dijkstra is applied for all edges one by one, shouldn’t the complexity be EVLogV and not VELogV

#5

…

yeah for brute force it is ->

evlogv is smae velogv

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.