Skip to content

LifeHashed/DFS-BFS-Graph-Travers

View on GitHub ↗Related repositories →

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-02 → 2024-10-21 (UTC)

Complete coverage27,335 / 27,335 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-09-26 (UTC)
Events
25
Pushes
20
Pull requests
3
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 20 days from 2024-10-02 to 2024-10-21. Pushes: 20 total, peak 10 in a day. Pull requests: 3 total, peak 3 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 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

ContributorContributionsPushesPRsComments
LifeHashed212010
sakeel-1032020

Recent activity

Latest issues, pull requests and releases

  • Pull request#2sakeel-1032024-10-02 14:36
  • Pull request#2sakeel-1032024-10-02 14:35
  • Pull request#1LifeHashed2024-10-02 13:20

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.