While I was reading Dijkstra's Algorithm I came across this algorithm(Bellman Ford's algorithm) and I was shocked to see negative weights also exist. As weights in the graph represent cost or distance how come these could be negative? I did google a lot but the answers are very confusing. Can somebody please explain it clearly and in simple terms.
Thanks in Advance.
Thanks in Advance.