Skip to content

feat: Brandes' algorithm #842

Description

@SemyonSinchenko

Is your feature request related to a problem? Please describe.
We should have something for approximate or exact betweenness centrality.

Describe the solution you would like
Brandes' algorithm looks like the only feasible solution for Pregel/BSP. We can add an option to sample instead of computing all the shortest paths.

Component

  • Scala Core Internal
  • Scala API
  • Spark Connect Plugin
  • Infrastructure
  • PySpark Classic
  • PySpark Connect

Additional context

Are you planning on creating a PR?

  • I'm willing to make a pull-request

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions