Skip to content
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.

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

Optimize clustring by ignoring computation of vertices that degree less than 2 #113

Closed
wants to merge 2 commits into from

Conversation

acezen
Copy link
Contributor

@acezen acezen commented May 23, 2022

…ss than 2

What do these changes do?

Related issue number

Fixes alibaba/GraphScope#1586

@acezen acezen changed the title Optimize clustring by ignoring computation of vertices that degree le… Optimize clustring by ignoring computation of vertices that degree less than 2 May 23, 2022
@codecov-commenter
Copy link

Codecov Report

Merging #113 (395df1d) into master (c6ad95d) will not change coverage.
The diff coverage is n/a.

Impacted file tree graph

@@           Coverage Diff           @@
##           master     #113   +/-   ##
=======================================
  Coverage   69.02%   69.02%           
=======================================
  Files          64       64           
  Lines        5494     5494           
=======================================
  Hits         3792     3792           
  Misses       1702     1702           
Flag Coverage Δ
app_tests 69.02% <ø> (ø)

Flags with carried forward coverage won't be shown. Click here to find out more.

@sighingnow
Copy link
Collaborator

The original issue has been addressed by alibaba/GraphScope#1597

@sighingnow sighingnow closed this Jul 14, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

[Proposal]Performance optimization in clustering coefficient
3 participants