Implementation of Dijkstra's shortest distance algorithm

geminw

Member
Licensed User
Longtime User
Using code written by William Lancee and adapted for an 8 x 6 board, find the shortest path from an origin to a destination. You can configure the origin (Yellow), destination (Blue) and obstacles (Black).

Captura de pantalla 2024-03-27 144106.png
 

Attachments

  • Dijkstra.zip
    9.9 KB · Views: 118
Top