Djikstra

From Wiki :-)

Revision as of 06:09, 11 June 2018 by Savoundg (talk | contribs) (Created page with "Djikstra is a greedy algorithm that solves the Shortest Path problem when the nodes weight are positive.")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Djikstra is a greedy algorithm that solves the Shortest Path problem when the nodes weight are positive.

Retrieved from "https://wiki.georges.savound.com/index.php?title=Djikstra&oldid=747"