Join GitHub today
GitHub is home to over 36 million developers working together to host and review code, manage projects, and build software together.Sign up
reduce propagate complexity from O(n2) to O(n) #3528
While working on the CI reproducibility, graph locks, etc, I found very slow graph propagation. This PR will highly alleviate it.
Measured, for a linear graph (A->B->C-> .... ->) of 250 nodes, the propagation (computed by ConanInstaller), reduces from 30 to 3 seconds.
Changelog: Feature: Improved graph propagation performance from
I am using https://github.com/conan-io/test/tree/master/conan_tests/performance to create a graph, then test manually over the created graph.