Search Algorithms Implementation

This project provides an implementation of several fundamental search algorithms in C++. The algorithms included are:

• Dijkstra's Algorithm: Finds the shortest paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
• Bellman-Ford Algorithm: Computes the shortest paths from a single source vertex to all other vertices in a graph that may contain negative edge weights.
• A-star Algorithm: Finds the shortest path between nodes using heuristics to improve efficiency in pathfinding.

Project Description

This repository contains code that is designed to be easily integrated into other projects. The primary component is the graph-related functionality, which can be seamlessly added to your own codebase.

Integration Instructions

1. Include the Code:

   • Add the search folder from this repository to your project directory.

2. Usage:

   • Include the header file graph.h in your source files where you need the graph functionality.

Example

Refer to the main.cpp file in this repository for a practical example of how to use the code.

Features

• CMake Support: The project uses CMake for build configuration and management.
• Direct Compilation: You can also compile the project directly using the provided g++ command.

Compilation

To compile the project, you have two options:

1. Using CMake:

# Check if the 'build' directory exists
if (Test-Path -Path "build") {
    Write-Output "Removing existing 'build' directory..."
    Remove-Item -Path "build" -Recurse -Force
}

# Create the 'build' directory
New-Item -Path "build" -ItemType Directory

# Change to the 'build' directory
Set-Location -Path "build"

# Run cmake and make commands
cmake -G "MinGW Makefiles" ..
mingw32-make

2. Direct Compilation:

g++ -std=c++23 -o main.exe main.cpp ./search/node.cpp ./search/graph.cpp -I search

Usage

After compilation, you can run the main.exe to execute the search algorithms. Ensure that all necessary source files are in the appropriate directories.

Contributing

Feel free to contribute to this project by submitting issues or pull requests. Your contributions are welcome!