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* ...

The program models a graph using an adjacency matrix and explores paths between nodes using a Depth-First Search (DFS) approach. The main focus of the project is understanding graph representation, ...

// and ending with item2. The list has one item if item1 and item2 are the // same, or no items if the path does not exist.