Explain how to code Dijkstra's shortest path for a high school competition

Правка en3, от kevinkowa, 2015-12-22 03:16:30

Hello, I'm still in high school and I have some problems trying to understand the Dijkstra's algorith. I wanted to know if someone would be so kind to show/teach me how to solve this kind of problems for high school competitions. I already understand and know how to code a BFS and a DFS, but I'm struggling with the dijkstra. I need a fast way to do it for the competitions. I use Java, but I should be able to understand other languages like c++, and c#

Теги dijkstra, help, high school

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский kevinkowa 2015-12-22 03:16:30 81
en2 Английский kevinkowa 2015-12-22 03:10:39 48 Tiny change: ' dijkstra.' -> ' dijkstra. I need a fast way to do it for the competitions'
en1 Английский kevinkowa 2015-12-22 03:10:03 400 Initial revision (published)