t3code
The best way to control Claude Code, Codex and more from any computer or phone
- 71k
- TypeScript
- MIT
- 4 h ago
Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.
Repo HxnDev/Graph-Based-DFS, read from GitHub 1 min ago. HxnDev has not joined Take My Repo.
HxnDev/Graph-Based-DFS is a public repo on GitHub by HxnDev. Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch. It declares the MIT license on GitHub. It is written mainly in Python, has 2 stars and last changed on 2021-07-27. Nobody has reviewed it on Take My Repo yet, which says nothing about its quality. Read from GitHub on 2026-11-22.
HxnDev/Graph-Based-DFS is a public repo on GitHub by HxnDev. Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.
It declares the MIT license on GitHub.
Its maker has not tagged a system, so it is unknown here. Its README says what it needs.
Open "Take it" on its page: Take My Repo writes an install plan for your machine and hands it to your AI agent (Claude Code, Codex or Cursor), which asks you before each step. Take My Repo has not tested it on any machine.
Its last change on GitHub was on 2021-07-27. GitHub counts 0 open issues and pull requests. Take My Repo does not judge from that whether it is maintained.
Nobody has reviewed it on Take My Repo yet, which says nothing about its quality.
Algorithms (Graph/Sort/Search) implemented from scratch in Kotlin. Built for learning, interview preparation, and understanding how common algorithms work.
Package provides javascript implementation of algorithms for graph processing