Abstract: This paper presents a procedural level generation system for a 2D top-down maze game titled Confined Space, utilizing the Depth-First Search (DFS) algorithm to create structured yet ...

Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

Abstract: This research addresses the map discovery issue for an autonomous robot in an unknown maze. Breadth First Search (BFS) and Depth First Search (DFS) algorithm can be used to do it. Here, we ...

An interactive Jupyter Notebook game that visualizes and finds the shortest path across a campus using graph theory algorithms like BFS, DFS, and Dijkstra’s Algorithm.

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.