Add gitattributes file

.gitattributes

@@ -0,0 +1,2 @@
+.gitattributes export-ignore
+.gitignore export-ignore

.gitignore

@@ -1,3 +1,4 @@
+.cache
 CMakeCache.txt
 CMakeFiles
 CPackConfig.cmake
@@ -5,6 +6,7 @@ CPackSourceConfig.cmake
 Makefile
 _CPack_Packages
 cmake_install.cmake
+compile_commands.json
 config.h
 install_manifest.txt
 mazemaker

CMakeLists.txt

@@ -1,6 +1,6 @@
 cmake_minimum_required (VERSION 3.0)
 cmake_policy(VERSION 3.0)
-project (mazemaker VERSION 2.0)
+project (mazemaker VERSION 2.1)
 
 SET(EXEC_INSTALL_PREFIX ${CMAKE_INSTALL_PREFIX} CACHE PATH "Installation prefix for executables and object code libraries" FORCE)
 SET(INCLUDE_INSTALL_DIR ${CMAKE_INSTALL_PREFIX}/include CACHE PATH "Installation prefix for C header files" FORCE)

lib/path.c

@@ -44,6 +44,7 @@ int mazemaker_solve(mazegrid_t const* maze, maze_path_t* path) {
         // check to see if we've reached the end 
         if ((x == maze->width - 1) && (y == maze->height - 1)) {
             path_copy(&top, path);
+            mazemaker_path_free(&top);
             code = 1;
             break;
         }
@@ -89,6 +90,9 @@ int mazemaker_solve(mazegrid_t const* maze, maze_path_t* path) {
                 PUSH_PQ(pq, PathPQ, newpath, dist + 1);
             }
         }
+
+        // delete old path
+        mazemaker_path_free(&top);
     }
 
     // If no path is found, we will run out of new nodes to explore, the queue
@@ -103,6 +107,7 @@ int mazemaker_solve(mazegrid_t const* maze, maze_path_t* path) {
         }
         FOREACH_PQ_END
     }
+    FREE_PQ(pq);
     node_set_free(set);
     return code;
 }