Hallo,

I have sent one more email previously. I 've got my little example for which Bellman-Ford fails to detect an existing negative cycle. This occurs after I modify the graph!

I would be glad if you could help me. Bellman-Fors shortest paths is a very important routine for my code, which I have to call several times. And it has to work reliably so that the rest of the code also does...

Thank you.

cheers,

Cigdem

---

Invite your mail contacts to join your friends list with Windows Live Spaces. It's easy! Try it!