https://github.com/KarimElghamry/GraphAV

A Graph Algorithms Visualizer built using React, Typescript and Styled Components.
https://github.com/KarimElghamry/GraphAV

algorithms graph-algorithms graph-algorithms-visualizer graphs react styled-components typescript visualization web-development

Last synced: 2 months ago
JSON representation

A Graph Algorithms Visualizer built using React, Typescript and Styled Components.

• Host: GitHub
• URL: https://github.com/KarimElghamry/GraphAV
• Owner: KarimElghamry
• License: mit
• Created: 2020-06-20T11:23:28.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2023-03-06T17:28:10.000Z (almost 2 years ago)
• Last Synced: 2024-08-01T19:54:28.032Z (5 months ago)
• Topics: algorithms, graph-algorithms, graph-algorithms-visualizer, graphs, react, styled-components, typescript, visualization, web-development
• Language: TypeScript
• Homepage: https://karimelghamry.github.io/GraphAV/
• Size: 1.91 MB
• Stars: 135
• Watchers: 8
• Forks: 8
• Open Issues: 14
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

• my-awesome-list - GraphAV

README

        
# GraphAV

[](https://karimelghamry.github.io/GraphAV/)  

 



- A graph algorithms visualizer built using React, Typescript and Styled Components.

- deployed at: https://karimelghamry.github.io/GraphAV/

**NOTE: touch screen is still not supported yet. Use a PC/Laptop for a better experience.**

### Show some :heart: and :star: the repo to support the project

## Features

**[✔]** Light/Dark themes

**[✔]** Add, move and delete nodes

**[✔]** Directed/Undirected edges

**[✔]** Unweighted edges

**[✔]** Control visualization speed

**[✔]** Control canvas zoom percentage

**[✔]** Shortest paths and predecessor node information

**[✔]** Visited nodes/edges animations

**[⛏]** Weighted edges (to be implemented)

**[⛏]** Touch screen support (to be implemented)

**[⛏]** Save/share graphs (to be implemented)

## Available Algorithms

**[✔]** DFS - Depth First Search

**[✔]** DLS - Depth Limited Search

**[✔]** IDDFS - Iterative Deepening Depth First Search

**[✔]** BFS - Breadth First Search (with shortest paths calculations)

**[✔]** Dijkstra (with shortest paths calculations)

**[⛏]** Bellman-Ford (to be implemented)

**[⛏]** Floyd-Warshall (to be implemented)

**[⛏]** A\* (to be implemented)

**[⛏]** Kosaraju (to be implemented)

**[⛏]** Tarjan's Strongly Connected Components\* (to be implemented)

**🎉 If you have any further suggested algorithms, feel free to open an issue! 😎**

## Demos

  

    DFS

     IDDFS

  

  

    

    

  

  

    Dijkstra

     BFS

  

  

    

    

  

 

## Authors

- [Karim Elghamry](https://github.com/KarimElghamry)

- [Ali Amin](https://github.com/Ali-Amin)