Skip to content

gnm: avoid redundant root path cost re-summation in KShortestPaths#14091

Open
KinshukSS2 wants to merge 1 commit intoOSGeo:masterfrom
KinshukSS2:fix/gnm-kshortest-paths-redundant-cost-summation
Open

gnm: avoid redundant root path cost re-summation in KShortestPaths#14091
KinshukSS2 wants to merge 1 commit intoOSGeo:masterfrom
KinshukSS2:fix/gnm-kshortest-paths-redundant-cost-summation

Conversation

@KinshukSS2
Copy link
Contributor

@KinshukSS2 KinshukSS2 commented Mar 8, 2026

description

the current method to find costs was that whenever a path was found then it usually checks the cost from the start thus making it less efficient

the fix i propose usually only plays a better role when there is a presence of long paths in large GNM networks
it basically only finds the cost for the new branches whenever created

fixes #14090

@rouault
Copy link
Member

rouault commented Mar 8, 2026

CC @BishopGIS

@KinshukSS2
Copy link
Contributor Author

any updates on the status of the pr...pls let me know if any changes are required from my side

@jratike80
Copy link
Collaborator

any updates on the status of the pr...

Waiting for someone to review. You know, this is open source, there are not many people who know gnm well, and there are also other things going on https://github.com/OSGeo/gdal/pulse.

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.

# GNMGraph::KShortestPaths redundantly re-sums root path cost on every spur iteration

3 participants