SemyonSinchenko / SemyonSinchenko/graphframes-rs

feat: approx triangle counting

Open
#25 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

enhancement
Dominant language
Rust
Stars
56
Forks
3
Avg merge
18h 12m
Merged PRs (30d)
7

Description

  • approx clustering coefficient

blocked by #24

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading issue #24, which blocks this work, then locate the graph-algorithm entry points for triangle counting and clustering coefficient. The issue names no files or tests; completion would require approximate triangle counting and an approximate clustering coefficient once the dependency is resolved.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
data
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Quiet
Clarity
Needs clarification
Newbie friendliness
30/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.