-
The current set of traversers are not sufficient for pathfinding or flooding to a range w/ obstacles. There are sort of two things needed that would make such things more easily doable.
1. A trave…
-
> We should consider... a depth counter to manage how deep we'll go. I've seen several hundred deep nested columns out in the wild before.
_Originally posted by @hntd187 in https://github.com/delta…
-
It would be nice to have lens instances so people using lens with Data.Map etc can easily migrate to this package.
-
If given the query (a)-[b where b.val > 100]->*(c)
A way to handle the filter would be to create a csr only on the filtered edges. Have to check if the standard even allows such a thing. Supporting h…
-
Is it possible to do traversals with levelgraph?
for example, follow the "friend" link up to 3 hops from X...
I've been drawing up some ideas here...
https://gist.github.com/dominictarr/6043557
But…
-
Traversing a tree is a bit more complicated than just Array.forEach.
In some cases, you may want to traverse links that point in either direction,
"documents links that link to X". In that case, you a…
-
Would be beneficial to have iterator functions (generators) for traversals rather than "generate a massive in-memory list".
To-determine:
* Should the *only* option be iterator traversals? and e…
-
```
A normal, "flat" traversal is based on a standard, flat graphs: each node has
a set of neighbors that are directly linked to it. When links contain more
than two nodes, this just yields more nei…
-
```
A normal, "flat" traversal is based on a standard, flat graphs: each node has
a set of neighbors that are directly linked to it. When links contain more
than two nodes, this just yields more nei…
-
Graphsync uses selectors but is primarily focused on the block layer -- all of it's communication is based on intercepting BlockReadOpener functions. Moreover, Graphsync wants to be able to stop a sel…