Skip to content

feat: add approximate triangle counting algorithm using DataSketches #789

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
SemyonSinchenko merged 5 commits into from
Feb 3, 2026
Merged

feat: add approximate triangle counting algorithm using DataSketches #789

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
19fcb7c
Add approximate triangle counting algorithm using DataSketches
SemyonSinchenko Jan 29, 2026
b08ddc3
fix python tests
SemyonSinchenko Jan 29, 2026
87a134b
from comments
SemyonSinchenko Feb 2, 2026
426dfd7
from comments
SemyonSinchenko Feb 2, 2026
ea3cfdc
revert changes in "exact"
SemyonSinchenko Feb 3, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
from comments
  • Loading branch information
@SemyonSinchenko
SemyonSinchenko committed Feb 2, 2026
commit 426dfd710ea4b77d6d35fbf9ae15d452d08ae9fd
10 changes: 5 additions & 5 deletions python/graphframes/graphframe.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -819,7 +819,7 @@ def svdPlusPlus(
)

def triangleCount(
self, storage_level: StorageLevel, algorithm: str = "exact", log_nom_entries: int = 12
self, storage_level: StorageLevel, algorithm: str = "exact", lg_nom_entries: int = 12
) -> DataFrame:
"""
Computes the number of triangles passing through each vertex.
Expand All @@ -836,15 +836,15 @@ def triangleCount(

:param storage_level: Storage level for caching intermediate DataFrames.
:param algorithm: The triangle counting algorithm to use, "exact" or "approx" (default: "exact").
:param log_nom_entries: The log2 of the nominal entries for the Theta sketch (only used
if algorithm="approx"). Higher values increase accuracy at the
cost of memory. (default: 12).
:param lg_nom_entries: The log2 of the nominal entries for the Theta sketch (only used
if algorithm="approx"). Higher values increase accuracy at the
cost of memory. (default: 12).
:return: A DataFrame containing the vertex "id" and the triangle "count".
""" # noqa: E501
if (__version__[:3] < "4.1") and (algorithm == "approx"):
raise ValueError("approximate algorithm requires Spark 4.1+")
return self._impl.triangleCount(
storage_level=storage_level, algorithm=algorithm, log_nom_entries=log_nom_entries
storage_level=storage_level, algorithm=algorithm, log_nom_entries=lg_nom_entries
)

def powerIterationClustering(
Expand Down
Loading