Skip to content

Conversation

@abhosekar
Copy link
Contributor

lop.py implementation for creating the set l and parameter rp from the shortest path tree is inefficient, taking over 1 minute to execute and it is not pythonic, difficult to read. This PR improves it significantly by using networkx data structures and algorithms, which takes as little as 1 second to execute. The final print results are identical.

@mabdullahsoyturk mabdullahsoyturk merged commit 9b7e2bb into GAMS-dev:master Jun 26, 2025
1 check failed
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.

2 participants