function findShortestPathDijkstra(topology) {
const start = findElevation(83, topology).join("");
const distances = new Map();
const previous = new Map();
const unvisited = new Set();
for (const [r, row] of topology.entries()) {
for (const [c] of row.entries()) {
distances.set(`${r}${c}`, Infinity);
previous.set(`${r}${c}`, undefined);
unvisited.add(`${r}${c}`);
}
}
distances.set(start, 0);
while (unvisited.size > 0) {
}
}