Write down an algorithm to check whether a directed, weighted graph contains a negative weighted cycle or not. Find the time complexity of this algorithm.

1 The diagram below shows a weighted, directed graph indicating how you can travel from one site to another site of a museum. 9 B D 1 A . 2 4 F 12 10 5 E