Implementation of Dijkstra's shortest distance algorithm

G

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: 35
You must log in or register to reply here.

Similar Threads

P
Another implementation of Dijkstra's shortest distance algorithm
Replies
2
Views
1K
carlos7000
carlos7000
William Lancee
  • Article
B4J Code Snippet [B4X] Dijkstra's Algorithm for Finding the Shortest Path Through a Connected Graph.
Replies
18
Views
2K
PABLO2013
PABLO2013
fredo
Games [x2][solved] Help needed regarding Object Movement
Replies
10
Views
3K
fredo
fredo
Top