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

Fix shortest path calculation with blocking centroids #257

Conversation

barisdemirdelen
Copy link
Contributor

Shortest path calculation with blocking centroids fails. This is because of blocking_centroid_flows() method in basic_path_finding.pyx

centroids variable contains the number of centroids in the graph. This method as is blocks and unblocks one too many node, which means if the graph is set to block the centroids, the first non centroid node of the graph is always blocked. If a shortest path would contain this node, then we either get no path or wrong path as a result.

@barisdemirdelen
Copy link
Contributor Author

I have some tests for this but not sure on where to put them. Let me try something and if you don't like it we can discuss

@pedrocamargo
Copy link
Contributor

ot sure on where to put them. Let me try something and if you don't like it we can discuss

That would be great if you could include it

@barisdemirdelen
Copy link
Contributor Author

I have added my tests for this.

@janzill janzill merged commit c7e00c1 into AequilibraE:master May 26, 2021
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.

None yet

3 participants