GitHub repository: JoseAugustoVital/Dijkstra-without-priority-queue
Created: 2023-10-12T03:58:44Z
Description: This project presents an algorithm for solving the problem of finding the minimum cost path in a directed graph. In cases of multiple paths with equal cost, it adopts a strategy of selecting the path with the shortest length, and in case of further ties, it chooses the lexicographically earlier path.