The DFS-BFS graph traversal project is built using Angular for the frontend and Node.js for the backend. It demonstrates two popular graph traversal algorithms: Depth-First Search (DFS) and Breadth-First Search (BFS). These algorithms are fundamental for exploring nodes and edges of a graph, solving a variety of computational and real-world problem
active 2024-10-31 → 2024-11-28 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 29 days from 2024-10-31 to 2024-11-28. Pushes: 2 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 1 total, peak 1 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| TejasSaraf | 2 | 2 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.