I have this algorithm that is pseudocode for the dijkstra algorithm for graph theory. The first thing that goes on is a basic for loop.
visitedSet[0] = true
You have to review how to access elements of 2D array. Also, take look at what comma operator does. You have to use []
twice:
adjacencyMatrix[0][i]
The following:
adjacencyMatrix[0, i]
is equivalent to:
adjacencyMatrix[i]
Which will still leave you with 1D array. And, as the error message says:
distanceArray[i] = adjacencyMatrix[i];
// ^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^
// unsigned int array of unsigned ints
You can not possibly expect this assignment to happen.