How to implement Dijkstra on implicit graph ? Suppose we have a 2-D matrix 'A' of dimensions nXn and we have to find the shortest way to reach A[n-1][n-1] from A[0][0].
Aucun commentaire:
Enregistrer un commentaire