What are the problems of Dijkstra's algorithm?

google.com.. simply.hope this helps

Dijkstra's algorithm has importance when you are trying to find the shortest path between two points. It's used in the computer networking field where routing protocols, like OSPF, uses it to find...

Yes,there is an obvious algorithm to test each possible trip and find the best one. The trouble is the exponential run-time.

Given a particular problem, the algorithm would be the method you implement to solve that problem.

The only difference between two is that Bellman Ford is capable also to handle negative weights whereas Dijkstra Algorithm can only handle positives.