Visualizer-Android

This Android App is a visualization tool for the Dijkstra's algorithm, a popular algorithm in graph theory used to find the shortest path between two nodes in a graph.

Installation

To install Visualizer-Android, you can either download the APK file from the "Releases" section of this repository, or you can clone the repository and build the app from source using Android Studio.

Cloning the Repository

1. Open a terminal and navigate to the directory where you want to clone the repository.

2. Run the following command to clone the repository:

   git clone https://github.com/huhu72/Visualizer-Android.git
   

Building and Running the App

1. Open Android Studio and select "Open an existing Android Studio project"
2. Navigate to the directory where you cloned the repository and select the "Visualizer-Android" directory.
3. Wait for Android Studio to finish building the project.
4. Connect an Android device to your computer, or use an emulator to run the app.
5. Click the "Run" button in Android Studio to build and run the app on the selected device.

Usage

To use the application, follow these steps:

1. Click the "Start" button to enable node selection mode.
2. Click any square to set it as the starting node.
3. Click the "End" button to enable end node selection mode.
4. Click any square to set it as the ending node.
5. Click the "Wall" button to enable wall node selection mode.
6. Click any square to set it as a wall node.
7. Click the "Run" button to run the algorithm and visualize the shortest path between the start and end nodes.
8. To reset the grid, click the "Reset" button.

Contributing

If you want to contribute to Visualizer-Android, feel free to fork the repository and submit a pull request. Make sure to follow the coding style and guidelines outlined in the repository.

License

Visualizer-Android is licensed under the MIT License. See LICENSE for more information.