Finding the shortest path between two entries in a matrix using different search algorithms able to move left/right and up/down.
Linux environemnt to run the code
Download the code and open a telnet connection in the terminal in your desired port. This will connect to the program compile with this command :
g++ -std=c++14 *.cpp -Wall -Wextra -Wshadow -Wnon-virtual-dtor -pedantic -o a.out -pthreadThe graphs are entered in a specific format:
a,b,c,d,e
f,g,h,j,p
...
...
entry_row, entry_col
exit_row, exit_col
end
where each letter represents a number. This number indicates the weight of the cell in the matrix - how much it costs to move to that position in the graph. The length of a path is the sum of the weights in the path and not necessarily the amount of steps it took.
Note: negative weights are ignored as they are treated as 'walls' the algorithm cannot pass, meaning it will search for a path around it.
The matrices don't have to be squares, but all the rows need to be the same size!
You can also change the starting position using the 'entry_row/col' numbers, and finish position using the 'exit_row/col' numbers. You can set these values to your liking or needs. Make sure your entry/exit position is within the matrix and isn't exceeding its size. The first row and column are numbered '0'. The final line of your input needs to be 'end' in order to tell the algorithm to start looking for the path.
Once the algorithm has finished searching for the path, it will display it in a sequence of instructions - go left, go right, etc.