New Graph struct
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
We want to turn graph view into a struct containing the Node semantics, Edge Semantics, Time semantics, applied filter and storage.
We can then remove the eval graph and have the same performance on the normal nodes and edges.
We can then rejig the accumlator/BSP functions to be more user friendly before writing a load of new algorithms - this may be a 'special' rotating node state which can be finalised into a normal one.
Rotating nodestate should be able to be initalised by a nodestate from prior algorithms
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
No files or tests are named; start by locating the graph view, eval graph, accumulator/BSP functions, and node-state implementation. Map how semantics, filters, storage, and rotating state currently work, then define completion as a Graph struct replacing the eval graph and supporting initialization from prior node state.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- data, databases
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100