Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.Sign up
Codechange: [Linkgraph] Skip MCF source node Dijkstra when all demand satisfied #7913
MCF Dijkstra iterations are executed for all source nodes in a round-robin order.
Executing Dijkstra's algorithm is relatively expensive, particularly on large graphs, it is useful to avoid executing it in cases where the output is not used.
… satisfied MCF Dijkstra iterations are executed for all source nodes in a round-robin order. Source nodes typically require different numbers of MCF Dijkstra iterations to satisfy all of their demand. This change is to avoid performing MCF Dijkstra iterations on source nodes which have already been fully satisfied.