DFS-BFS-Graph-Travers neeru24 · COMPLETED
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
github.com/neeru24/DFS-BFS-Graph-Travers · ★ 0 · Forks 0 · Size 10.8 MB
SUMMARY
Technologies 15
Scored 15
Observed 15
Practices 6
Evidence 16
Skips 0
COVERAGE
Analyzed 194 files · 528 commits · 0 API calls
TECHNOLOGIES & DEPTH
TypeScript LANGUAGE Depth 70
54 files · PRODUCTION
JavaScript LANGUAGE Depth 70
8 files · PRODUCTION
JSON LANGUAGE Depth 70
13 files · PRODUCTION
TOML LANGUAGE Depth 70
1 files · PRODUCTION
Markdown LANGUAGE Depth 70
4 files · PRODUCTION
YAML LANGUAGE Depth 70
13 files · PRODUCTION
Python LANGUAGE Depth 70
1 files · PRODUCTION
npm BUILD_TOOL Depth 80
1 files · CONFIGURATION
Angular FRAMEWORK Depth 93
50 files · CONFIGURATION, PRODUCTION, TEST
ESLint QUALITY Depth 61
1 files · CONFIGURATION
Express FRAMEWORK Depth 58
1 files · PRODUCTION
MongoDB DATABASE Depth 93
5 files · CONFIGURATION, PRODUCTION
Socket.IO LIBRARY Depth 58
1 files · PRODUCTION
Spring Framework FRAMEWORK Depth 93
23 files · CONFIGURATION, PRODUCTION
body-parser LIBRARY Depth 58
1 files · PRODUCTION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · observedcontainerization · absentlinting · absentformatting · observed
ACTIVITY & OWNERSHIP
First commit 2024-09-27
Last commit 2024-11-01
Active months 3
Commits 528