Dijkstra, E.W. (1959) A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269-271.

Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.

One of common algorithms in solving shortest path problem is Dijkstra's algorithm. In this paper, Dijkstra's algorithm has been redesigned to handle the case in which most of parameters of a network ...

This project solves the problem of transporting heavy loads between cities by finding viable paths through viaducts with height restrictions, using a modified Dijkstra's algorithm for optimal routing.

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One ...