https://github.com/amancore/codeflow
CodeFlow is an interactive algorithm visualizer that simplifies complex concepts into step-by-step animations. It features visualizations for binary search, N-Queens, prime numbers, and various sorting algorithms, enhancing understanding and engagement in learning. Explore, learn, and contribute to the project on GitHub.
https://github.com/amancore/codeflow
algorithms-and-data-structures dijsktra-algorithm recursion-algorithm sorting-algorithms visualization
Last synced: 22 days ago
JSON representation
CodeFlow is an interactive algorithm visualizer that simplifies complex concepts into step-by-step animations. It features visualizations for binary search, N-Queens, prime numbers, and various sorting algorithms, enhancing understanding and engagement in learning. Explore, learn, and contribute to the project on GitHub.
- Host: GitHub
- URL: https://github.com/amancore/codeflow
- Owner: amancore
- Created: 2025-03-04T13:17:43.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2025-09-15T13:51:32.000Z (8 months ago)
- Last Synced: 2025-09-15T15:16:08.355Z (8 months ago)
- Topics: algorithms-and-data-structures, dijsktra-algorithm, recursion-algorithm, sorting-algorithms, visualization
- Language: JavaScript
- Homepage: https://code-flow-rho.vercel.app
- Size: 2.42 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Code Flow
Code Flow is a **React-based** project that provides interactive visualizations for a variety of algorithms. It breaks down complex concepts into step-by-step graphical representations, making it easier for learners to grasp algorithmic principles.
## Overview
Currently, there are **6 main segments**, with a total of **10 algorithms implemented**, and plans to add more in the future.
## Segments
- **Dijkstra**: Visualize shortest path finding in graphs.
- **Prime Numbers**: Explore the distribution and identification of prime numbers.
- **Binary Search**: Demonstrate efficient searching in sorted arrays.
- **Recursion Tree**: Map out recursive function calls and structures.
## Implemented Algorithms
### Graph Search
- DFS (Depth-First Search)
- BFS (Breadth-First Search)
- Dijkstra
- Recursive Maze Creation
## Other Algorithms
- Sieve of Eratosthenes (for prime numbers)
=======
- Graph Search
- DFS
- BFS
- Dijkstra
- Recursive Maze Creation
- Sieve of Eratosthenes
- N Queen Backtracking
- Binary Search
- Recursion
- Fibonacci Number
## Getting Started
### Prerequisites
- Node.js and npm (for development and running the project)
- A modern web browser (e.g., Chrome, Firefox)
- Git (to clone the repository)
### Installation
1. Clone the repository:
```bash
git clone https://github.com/yourusername/code-flow.git
```
2. Navigate to the project directory:
```bash
cd CodeFlow
```
3. Install dependencies:
```bash
npm install
```
4. Start the development server:
```bash
npm start
```
The application will be available at `http://localhost:3000`.
## Usage
1. Open the app in your browser.
2. Select an algorithm or segment from the menu.
3. Interact with the visualization: step through processes, adjust parameters (e.g., array size, graph nodes), and observe the algorithm in action.
4. Use controls to play, pause, reset, or speed up the animation.
## Contributing
Contributions are welcome to expand the library of algorithms or improve existing visualizations! To contribute:
1. Fork the repository.
2. Create a new branch:
```bash
git checkout -b feature/new-algorithm
```
3. Make your changes and commit them:
```bash
git commit -m 'Add new algorithm visualization'
```
4. Push to the branch:
```bash
git push origin feature/new-algorithm
```
5. Open a pull request.
## Contact
For questions, suggestions, or issues, feel free to open an issue on GitHub or reach out via [xamancore@gmail.com](mailto:xamancore@gmail.com).
Enjoy exploring algorithms with Code Flow! 🚀