Implementation of Dijkstra's shortest distance algorithm

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).