How is linear algebra used within A* pathfinding algorithms?
I know that a graph can be
expressed as a matrix of the weights of the edges and a vector of the optimistic cost of the nodes. However I’m having trouble figuring out what kinds of matrix operations are needed to get from a matrix of weights and a vector of costs to a decision about which is the optimal path.
The particular application I am interested in is robotic path planning.