Repository files navigation
Dynamic Grid Generation : Automatically adjusts to your screen sizeReal-time Wall Building : Click and drag to create obstaclesStart/End Point Placement : Drag to reposition start (green) and end (red) pointsResponsive Design : Works seamlessly on different screen sizes
Breadth-First Search (BFS) : Explores level by level, guaranteed shortest pathDepth-First Search (DFS) : Goes deep first, explores all possible pathsMulti-Source BFS : Bidirectional search from both start and end points
Smooth Node Transitions : Each visited node animates with particle effectsPath Visualization : Animated path reconstruction with glowing effectsInteractive Controls : Hover and click animations on all UI elementsParticle Background : Floating particles create an immersive experience
4 Speed Levels : 0.5x, 1x, 2x, and 4x visualization speedsPlay/Pause : Control algorithm execution in real-timeReset Functionality : Clear the grid and start freshReal-time Stats : Live algorithm statistics and node count
Dark/Light Mode : Toggle between themes with animated transitionsGlassmorphism Design : Modern frosted glass effect on controlsResponsive Layout : Optimized for desktop and mobile viewingLoading Screen : Beautiful animated startup sequence
Click and Drag : Create walls by clicking and dragging on empty cellsDrag Start/End : Click and drag the green (start) or red (end) nodes to reposition themAlgorithm Selection : Choose from BFS, DFS, or Multi-Source BFS from the dropdownSpeed Control : Click the speed button to cycle through 0.5x, 1x, 2x, and 4x speedsPlay/Pause : Use the play button to start or pause the algorithmReset : Click the refresh button to clear the grid and reset everything
Understanding the Visualization
Green Node : Starting pointRed Node : Destination pointBlue Nodes : Visited cells during algorithm executionYellow Path : Final path from start to endGray Walls : Obstacles that algorithms must navigate around
Breadth-First Search (BFS)
Time Complexity : O(V + E) where V is vertices and E is edgesSpace Complexity : O(V)Guarantee : Always finds the shortest pathBest For : Finding shortest paths in unweighted graphs
Time Complexity : O(V + E)Space Complexity : O(V) in worst caseGuarantee : Finds a path (not necessarily shortest)Best For : Exploring all possible paths, maze solving
Time Complexity : O(V + E)Space Complexity : O(V)Guarantee : Finds shortest path with bidirectional searchBest For : Faster pathfinding in large grids
About
Resources
Stars
Watchers
Forks
You can’t perform that action at this time.