This research is conducted to design and develop a new algorithm for finding out the classic “Shortest Path” between every pair of vertices using an atypical approach. The approach follows the ...

algorithm graph-algorithms priority-queue data-structures binary-search-tree sorting-algorithms heap tree-structure search-algorithm dynamic-programming shortest-paths hash-algorithm heuristics ...

Computer Science subject module at Roskilde University. Was made as part of a 15ETCS course where we applied Different Pathfinding strategies to solve shortest path problem. Contains Dijkstra and A* ...