Теория графов. Желательно с подробным обьяснением. Как посчитать количество операций в 1 итерации?

Question

[raihzel96]

Count and compare the number of iterations for each algorithm above, and also the number of operations in each iteration (an operation is defined as either a comparison in the node list or checking the node distance).
i. Dijkstra
ii. Bellman-Ford-Moore
iii. Pape