# Difference between Dijkstra's algorithm and Bellman-Ford's algorithm?

Have a read of this and then make your own mind up;http://www.iekucukcay.com/?p=65Best of luck with your research, Bob.

http://answers.yahoo.com/question/index?qid=20130421093828AAaPilu

## How to Use the Hungarian Algorithm?

The Hungarian algorithm allows a "minimum matching" to be found. This can be used in instances where there are multiple quotes for a group of activities and each activity must be done by a differen...
Read More »

http://www.wikihow.com/Use-the-Hungarian-Algorithm

## How to Use Dijkstra's Algorithm?

The "path of minimum weight" algorithm.[1] It works in the same way as a route planner for your car, helping you to find the route of least distance, shortest time or in fact any "minimum" for your...
Read More »

http://www.wikihow.com/Use-Dijkstra%27s-Algorithm

## How to Use the Nearest Neighbour Algorithm?

The nearest neighbour algorithm works in a similar way to Prim's algorithm, but instead of finding a tree you find a path around your graph/network.

http://www.wikihow.com/Use-the-Nearest-Neighbour-Algorithm

## How to Use the Chinese Postman Algorithm?

Postmen need to travel every street, but what happens when you get to a fork in the road? Suddenly there is no easy way to travel every street. This is where the Chinese postman algorithm comes int...
Read More »

http://www.wikihow.com/Use-the-Chinese-Postman-Algorithm