Which of the following statements is/are correct?
Consider 'n' as the number of nodes in graph.
A.In an unweighted, undirected connected graph, Dijkstra’s algorithm can be used to compute shortest path from node S to all the other vertices.
B.Bellman’s ford algorithm always detects a negative weighted cycles if it exists.
C.The time complexity of Dijkstra’s algorithm using unsorted array for the greedy selection of vertices and adjacency matrix is theta(n^2)
D.The time complexity of Bellman’s ford algorithm is always theta(n^3)
