0
I am writing the solution of Dijkstra's algorithm on js The code below, this is what has happened so far. I need to make it so that the choice of nodes is by recursion. Tell me how to do this better.
const size = 6;
сonst maxInt = 999999;
const graph = [
[null, maxInt, 50, 20, maxInt, 30],
[...