Complexity not clear

#1

one more doubt plz give idea how to go ahead with these modifications of dijkstra
like

  1. when there is given that at most x flights could be taken
  2. to reach from source to destination i have to maintain order of some citites like i should travel to city x before reaching city y in the final path…
    plz guide
#2

this doubt is from icpc trip interesting grpahs problem lecture

#3


you can refer the code here.
for atmost x flights, you can create an additional parameter about the time it the node comes.

#4

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.