Revisi per 14 November 2006 14.05 sunting Xyz or die (bicara \| kontrib) 256 suntingan Tidak ada ringkasan suntingan		Revisi per 14 November 2006 14.06 sunting balikkan Xyz or die (bicara \| kontrib) 256 suntingan Tidak ada ringkasan suntingan Revisi selanjutnya →
Baris 1: '''Algoritma Dijkstra~~'s algorithm~~''', ~~named~~dinamai ~~after~~menurut ~~its discoverer~~penemunya, ~~Dutch [[computer science\|computer scientist]]~~ [[Edsger Dijkstra]], ~~is a~~adalah [[greedy algorithm]] ~~that~~yang ~~solves the single-source~~memecahkan [[shortest path problem]] ~~for~~untuk asebuah [[directed graph]] ~~with~~dengan ~~nonnegative [[~~edge ~~(graph~~weights ~~theory)\|edge]]~~yang ~~weights~~tidak negatif. For example, if the [[vertices]] of the graph represent cities and edge weights represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between two cities.

Algoritma Dijkstra: Perbedaan antara revisi