add sample project files

[robmck1995]

Description

• Implemented the A* search algorithm in multiple languages including Bash, C++, and Python.
• Added visualization for the A* search results using Unicode symbols in Bash and console output in C++.
• Defined classes for points, nodes, and maps in C++ to support the A* algorithm.
• Initialized Go module for the project.

---

Changes walkthrough

	Relevant files
Enhancement	astar_search.sh Implement A* Search Algorithm in Bash                                                    sample_project/astar_search.sh Implemented A* search algorithm in Bash. Added functions for grid generation, pathfinding, and visualization. Utilized Unicode symbols for grid display. +371/-0  astar.cpp Implement A* Search Algorithm in C++                                                      sample_project/cpp_classes/astar.cpp Implemented A* search algorithm class. Added methods for distance calculation and pathfinding. Managed open and closed lists for nodes. +102/-0  astar_search.cpp Execute A* Search with Visualization in C++                                        sample_project/astar_search.cpp Created main function to execute A* search. Integrated map and pathfinding visualization. +31/-0    map.cpp Define Map Class for A* Search Grid                                                        sample_project/cpp_classes/map.cpp Defined map class with grid initialization. Implemented operator for grid access. +18/-0    point.cpp Define Point Class with Operators                                                            sample_project/cpp_classes/point.cpp Defined point class with operators. Implemented equality and addition operators. +7/-0      node.cpp Define Node Class for A* Search                                                                sample_project/cpp_classes/node.cpp Defined node class for A* search. Implemented comparison operators. +8/-0      graph.py Implement A* Graph Class in Python                                                          sample_project/graph.py Implemented A* graph class. Added heuristic and neighbor functions. Defined movement cost with barriers. +32/-0
Configuration changes	go.mod Initialize Go Module for Project                                                              sample_project/go.mod - Initialized Go module for A* search project. +3/-0

💡 Usage Guide

### Checking Your Pull Request Every time you make a pull request, our system automatically looks through it. We check for security issues, mistakes in how you're setting up your infrastructure, and common code problems. We do this to make sure your changes are solid and won't cause any trouble later. ### Talking to CodeAnt AI Got a question or need a hand with something in your pull request? You can easily get in touch with CodeAnt AI right here. Just type the following in a comment on your pull request, and replace "Your question here" with whatever you want to ask:

@codeant-ai ask: Your question here

This lets you have a chat with CodeAnt AI about your pull request, making it easier to understand and improve your code. ### Retrigger review Ask CodeAnt AI to review the PR again, by typing:

@codeant-ai: review

### Check Your Repository Health To analyze the health of your code repository, visit our dashboard at [app.codeant.ai](https://app.codeant.ai). This tool helps you identify potential issues and areas for improvement in your codebase, ensuring your repository maintains high standards of code health.

[codeant-ai[bot]]

Things to consider 🐛

• In sample_project/astar_search.sh, the function find_path (lines 261-321) does not handle the case where no path is found. If the openVertices list becomes empty without reaching the end, the function should return an indication of failure, but it currently does not handle this scenario.

• In sample_project/cpp_classes/astar.cpp, the search function (lines 68-79) does not sort the open list before selecting the node with the lowest cost. The commented-out line open.sort(); suggests that sorting was intended but not implemented, which may lead to incorrect pathfinding results.

• In sample_project/graph.py, the get_vertex_neighbours function (lines 17-26) does not account for barriers when determining valid neighbors. This could lead to invalid paths being considered if a barrier is adjacent to the current position.