خرید بک لینک

Vote count: 0

I'm trying to find an example of a directed graph with negative weights (no negative cycles) such that ruing dijksra on it will produce wrong results for all the vertices in the graph (except to the source node).

It isn't very hard to find an example to a graph where some of the results produced by dijkstra are wrong. but i can't find an example to a graph as described above, can anyone help me with it?

thanks.

asked 52 secs ago

برچسب: dijkstra with negative weights,dijkstra algorithm negative weights add constant,dijkstra's algorithm with negative edge weights example, نویسنده: استخدام کار تاريخ: دوشنبه 15 شهريور 1395 ساعت: 2:09

صفحه بندی