Open dngreenst opened 5 years ago
the implementation will only return a matrix of weights for each nodes. the usage of the result will be to choose a destination and calculate a path.
the implementation will receive a matrix of values which are the combined maze and ant locations. assignment of weights for known and unknown nodes will also be included in the matrix
Create a dijkstra algorithm implementation and integrate.