Programming, Data Structures, Algorithms, Computer Science, Tech.
node a to node a is actually just 0! Now that we’ve initialized our table, we’ll need one other thing before we can run this algorithm: a way to keep track of which nodes we have or haven’t visited! We can do this pretty simply with two array structures: a visited array and an unvisited array.