Evolving conditions on neighbour chaining
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
Currently we are able to call functions such as neighbours multiple times on a vertex which will then be unravelled in the core to return nodes n hops away - for example the below will return out neighbours 3 hops away:
vertex.out_neighbours().out_neighbours().out_neighbours()
We would like to define some evolving conditions on these functions which allow us to say always move forward or backwards in time when traversing. This can be done within the eval api already, but it would be nice to have a shorthand for this in python etc.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the Python neighbour functions and the existing eval API, which the issue identifies as supporting evolving conditions. Determine how repeated neighbour calls are unravelled and what temporal direction conditions must express; done means a documented shorthand supports forward and backward traversal across chained calls.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python, rust
- Domain
- backend-api-design, databases
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100