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
The text was updated successfully, but these errors were encountered: