-
Create utilities to simplify scene-graph traversal, e.g. by creating an iterator that handles the recursion behind the scenes, and some way of searching for objects by name.
-
## My Environment
* __ArangoDB Version__: 3.6.1
* __Storage Engine__: RocksDB
* __Deployment Mode__: Cluster
* __Deployment Strategy__: Manual Start in Docker
* __Infr…
-
-
Issue #1 says that we should replace `chain` with `interleave`. While this choice is generally wise it is still a choice. The pattern by which logpy searches for solutions should be programmable. W…
-
Implement graph traversal(BFS and DFS) algorithms for implicit graphs in any language.
-
I wish to create a notebook explaining the various graph traversal algorithms discussed [here](https://networkx.org/documentation/latest/reference/algorithms/traversal.html)
Let me know if I have t…
-
We re-implement the logic of traversing an `Entry` graph multiple times in our codebase, performing a different action at each node or tracking different metadata. These use cases could potentially b…
-
## My Environment
* __ArangoDB Version__: 3.11.10
* __Deployment Mode__: Single Server
* __Deployment Strategy__: ArangoDB Starter in Docker
* __Configuration__: def…
-
```C++
class Graph{
private:
int num_vertex;
std::vector< std::list > AdjList;
int *color, // 0:white, 1:gray, 2:black
*predecessor,
*discover,
…
-
It looks like there's no functionality to traverse a scene graph (ie. parent/child connections). Is that correct? Just checking in case I'm blind, before I implement it myself.
I see the connection…