-
The [candidate examination algorithm](https://drafts.csswg.org/css-scroll-anchoring/#candidate-examination) visits absolutely positioned elements twice. First it does:
> 1. For each DOM child C of…
-
# Important:
Before you start your work on this issue, **make sure** you go through the README.md and Contribution Guidelines.md and
# do not submit plagiarized code.
## File structure:
1. Wi…
-
# Important:
Before you start your work on this issue, **make sure** you go through the README.md and Contribution Guidelines.md and
# do not submit plagiarized code.
## File structure:
1. Wi…
-
[Cascaded unions](http://lin-ear-th-inking.blogspot.com/2007/11/fast-polygon-merging-in-jts-using.html) are a desirable feature for the `geo` library. However, the algorithm requires [post-order trave…
-
The various Tree traversal algorithms such as BFS, DFS , Level-order Traversal, which are very important for being able to work with Trees .I would like to contribute to this problem as a part of GS…
-
The current approach traverses the original database to stop at a certain defined cut-off. It may happen that in a prospective database the production technologies are so different that processes abov…
-
First, thank you for very elegant, concise, and useful tool. I use both tools: estraverse and recently shift-traverse for my projects.
One thing that I am missing is backward AST traversal. IMHO It w…
-
Developers are currently forced to manage any context their visitor interfaces require above and beyond the context provided by the request object passed to each callback by the algorithm. Typically, …
-
## 🚀 Feature
GPU traversal (dfs/bfs/topological/...)
## Motivation
Currently we only implement single thread traversal on CPU, it's not efficient and the frontiers cannot be generated on-the-fly …
-
The current implementation has time complexity `O(n^2)`. It could be improved to `O(n)` by using recursion. I think it would be beneficial to have both approaches as it is the classic dilemma time vs.…