167
Floyd's Algorithm
(cont)
Cost analysis …
initialising
dist[][]
,
path[][]
⇒
O(V
2
)
V
iterations to update
dist[][]
,
path[][]
⇒
O(V
3
)
Time complexity of Floyd's algorithm:
O(V
3
)
(same as Warshall's algorithm for transitive closure)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}