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.

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

Jump to bottom

Performance of path calculation #9

Open
IngoScholtes opened this issue Nov 20, 2017 · 1 comment
Open

Performance of path calculation #9

IngoScholtes opened this issue Nov 20, 2017 · 1 comment
Labels
enhancement
Milestone
2.0

Comments

@IngoScholtes
Copy link
Collaborator

The function HigherOrderNetwork.getShortestPaths is a bottleneck for the calculation of centralities.

I believe that we can make this more efficient, as it currently takes several minutes even for higher-order networks that only have a few hundred nodes and a few thousand links.

Moreover, for the calculation of betweenness centrality, we can adopt faster algorithms like the one by Brandes et al., see here: www.tandfonline.com/doi/abs/10.1080/0022250X.2001.9990249
@IngoScholtes IngoScholtes added this to the 2.0 milestone Nov 20, 2017
@IngoScholtes IngoScholtes mentioned this issue Sep 14, 2018
Open
@IngoScholtes
Copy link
Collaborator Author

Kamino cloned this issue to uzhdag/pathpy

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
2.0
Development

No branches or pull requests
1 participant
@IngoScholtes