-
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…
-
It would be nice to have lens instances so people using lens with Data.Map etc can easily migrate to this package.
-
Hi. As a start, I'll shortly say that I was looking for a portable, fully functioning, precompiled for many platforms, SOCKS5 Server, and this one caught my attention and was the best in my testing so…
-
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…
-
```
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…
-
```
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…
-
Originally reported on Google Code with ID 24
```
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 …