thefrontside / thefrontside/graphgen
Explore laziness
Nobody has claimed this yet.
- Dominant language
- TypeScript
- Stars
- 19
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
Graph generation can be lazy if we say that the initial entry points are fixed and then the graph cannot be changed ever again:
e.g. 10,000 users, 40,000 devices.
If we guaranteed that, then it doesn't matter if we walk the graph lazily because with same seed and same inputs, we'll get the same results.
Contributor guide
No contributing guide indexed for this repository
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, tests, or entry points are named in the issue. Start by locating the graph-generation entry points and existing determinism tests, then clarify how fixed initial entry points and immutable graphs should be represented before defining completion criteria for lazy generation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- typescript
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100