Find shortest path in 0,1 matrix from (0,0) to (n-1,n-1)

• Use Breadth First Search (BFS) algorithm to find shortest path

• Create a visited matrix to keep track of visited nodes

• Create a distance matrix to ...read more