A* Algorithm in OpenGL

An implementation of the A* search algorithm using C++ and OpenGL.
This project was developed for the Computer Graphics course at FINKI.

How It Works

• The program starts with a blank white grid.
• Left Mouse Clicks:
  • First click (Yellow square) → Sets the starting point.
  • Second click (Blue square) → Sets the ending point.
  • Subsequent clicks → Add barriers (Black squares).
• Right Mouse Click: Removes a previously placed barrier.
• Spacebar: Runs the A* algorithm to find the shortest path.
• Enter: Resets the grid.

Versions

• 2D Version
• 3D Version