Skip to content

Add BFS/DFS Graph Traversal Algorithm (Phase 1 - Essential) #6

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
github-actions merged 1 commit into from
Sep 24, 2025
Merged

Add BFS/DFS Graph Traversal Algorithm (Phase 1 - Essential) #6

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 10 additions & 4 deletions algorithms.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -287,13 +287,19 @@ <h3 class="algorithm-title">Binary Search Tree</h3>
</ul>
</a>

<div class="algorithm-card coming-soon">
<a href="algorithms/bfs-dfs-graph-traversal.html" class="algorithm-card">
<div class="algorithm-icon" style="background: linear-gradient(135deg, #f59e0b, #d97706);">
🕸️
</div>
<h3>BFS/DFS Graph Traversal</h3>
<p>Coming Soon - Animated graph traversal with queue/stack visualization</p>
</div>
<h3 class="algorithm-title">BFS/DFS Graph Traversal</h3>
<p class="algorithm-description">Interactive visualization of Breadth-First Search and Depth-First Search algorithms</p>
<ul class="algorithm-features">
<li>Switch between BFS and DFS algorithms</li>
<li>Animated graph traversal with queue/stack visualization</li>
<li>Customizable graph size and start node</li>
<li>Step-by-step algorithm explanation</li>
</ul>
</a>

<div class="algorithm-card coming-soon">
<div class="algorithm-icon" style="background: linear-gradient(135deg, #ef4444, #dc2626);">
Expand Down
Loading