# Apply Floyd Warshall algorithm

path$\_$floyd$\_$warshall $=$ nx$.$floyd$\_$warshall$\_$numpy$($G$)[$source$][$target$]$

length$\_$floyd$\_$warshall $=$ nx$.$bellman$\_$ford$\_$path$\_$length$($G$,$ source, target$)$

time$\_$bellman$\_$ford $=$ time.time$()-$ start$\_$time

print$($f$"$Floyd Warshall shortest path: $\{$length$\_$floyd$\_$warshall$\},$ Time: $\{$time$\_$bellman$\_$ford$\}")$