This. distancevector algorithm. works by computing the shortest path , and considers weights. The algorithm was distributed widely in the RIP protocol.
http://wiki.answers.com/Q/How_does_the_bellman_for...

The BellmanFord algorithm computes singlesource shortest paths in a weighted digraph (where some of the edge weights may be negative) Dijkstra's algorithm accomplishes the same
http://answers.yahoo.com/question/index?qid=100602...

Not entirely sure what you mean by "representing the input". Does this help http://lkm.fri.unilj.si/rmarko/aps1/util/bf/html_eng/bellfordie.html ?
http://www.expertsexchange.com/Microsoft/Developm...

Both, the BellmanFord algorithm and Dijkstra's algorithm are used to calculate 'metrics' (distance/cost of traversing a link) in routing protocols. Both of them consider only hop
http://www.quora.com/ComputerNetworking/HowdoBe...
