-
**Is your feature request related to a problem? Please describe.**
Because we advocate using compliant hydroelastics as the preferred mode of contact, the tet-tet pair culling is incredibly important.…
-
## Background
Currently, the hierarchical records generator uses a lot of auxiliary arrays, maps, etc. Maybe if the parser could specify child segments for segment redefines instead of setting parent…
-
How about some linked list data structures, both singly and doubly linked, and simple traversal, insertion, deletion, search and traversal algorithms? I'll work on this too.
-
LabelledBy Recursion is not actually recursive, so it (and the WPT test file) should be renamed.
_Originally posted by @cookiecrook in https://github.com/w3c/accname/issues/209#issuecomment-1774181…
-
Graph traversal is a basic task when working with graphs.
It would be helpful to have such an algorithm build into the cpg library.
Ideally, the user could specify a visitor function and this functi…
-
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.…
-
Thank you for building a great tool!
One thing that I've missed is the ability to `focus`, `move` and `join-with` using clockwise/counterclockwise navigation, akin to `mod1 + j`, `mod1 + k` etc. i…
-
We currently generate invalid implied alignment. The pre-order traversal of implied alignment algorithm relies on knowing if the current node is the left or right child of it's parent. This informatio…
-
One of the most famous algorithm for graph traversal.
-
This problem was assigned in [Readings 04]() but was much more difficult than I realized.
This is a tree I considered
```mermaid
graph TD
17--->9
17--->24
9--->5
9--->13
…