Random non-neighbour vertex selection
Open
Nobody has claimed this yet.
Algorithms
Semantics/API
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
From @ljeub-pometry:
We want a way to sample random Vertices from a graph that are not connected to the current vertex, e.g., teleportation in random walks
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
The issue does not name a file, test, or entry point. Start by locating the graph APIs for sampling or traversing vertices, then determine how a non-neighbour sample should be exposed and verified for random-walk teleportation; done means the requested sampling behavior is defined and covered by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- databases
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100