Generalizations on backtracking algorithms (w or w/o recursion). They can use whatever data-structures and heuristic functions.
My own take on A*/Dijkstra Pathfinding. Its a generalization to permit all implementations while using any data-structures and heuristic functions regardless of whether or not the "map" fits in memory.
Add a description, image, and links to the user-defined-structures topic page so that developers can more easily learn about it.
To associate your repository with the user-defined-structures topic, visit your repo's landing page and select "manage topics."