frontend-collective / frontend-collective/react-sortable-tree
Performant implementation of `find`
Open
enhancement
todo
- Dominant language
- JavaScript
- Stars
- 5k
- Forks
- 914
- PR merge metrics
- No merged PRs in 30d
Description
related: #338
currently we use dfs and recursion to traverse the tree, which can be extremely un-performant.
explore other options such as bfs with a queue.
Contributor guide
No contributing guide indexed for this repository
Research direction
Start by locating the tree `find` implementation and read related issue #338 for context. Compare the current recursive DFS with a queue-based BFS or other alternatives, then verify that the chosen implementation preserves `find` behavior while improving traversal performance.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript, react
- Domain
- frontend, performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100