diff options
| author | Kirill Petrashin <kirill8201@yandex.ru> | 2026-04-10 22:16:44 +0300 |
|---|---|---|
| committer | Kirill Petrashin <kirill8201@yandex.ru> | 2026-04-10 22:16:44 +0300 |
| commit | d676ac91b1906f5de8695facb6b96bf0509e6e1f (patch) | |
| tree | 5bfe0fb9e89721508202296e87acf7b53c9f011d /main.c | |
| parent | 221797b2506bc54483042b8a7beb0aa016f4f8e6 (diff) | |
| download | astar-d676ac91b1906f5de8695facb6b96bf0509e6e1f.tar.xz | |
Clean up trailing whitespaces
Diffstat (limited to 'main.c')
| -rw-r--r-- | main.c | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -16,7 +16,7 @@ /* So, TODO for now: - Allow maps to have costs - - Write out the amount of visited squares (to see how algorithms differ in + - Write out the amount of visited squares (to see how algorithms differ in efficiency) - Map editor function - Rework the UI, probably completely @@ -201,12 +201,12 @@ int main(int argc, char **argv) { path = path_func(dirs, map, width, height, start_pos, end_pos, visited, anim); } break; - case 'e': + case 'e': is_maze = 0; visited_free(visited, height); path_free(path, height); - map_editor(&map, &width, &height, &start_pos, &end_pos); + map_editor(&map, &width, &height, &start_pos, &end_pos); wrefresh(curscr); visited = visited_new(width, height); |
