One novel strategy for the link-state routing algorithms is proposed. It combines the features of the minimum-hop and the shortest-path strategies and is based on calculation of flow-augmenting path for each destination. This path contains minimum number of links while avoiding those that are congested. The strategy introduces a unique property of being able to trigger the congestion control scheme when necessary. Its performance was investigated upon a flow model of a sample network. The results obtained are encouraging and favor the proposed strategy in termes of lower resource usage, higher reliability, smaller processing time and possibility for tradeoff between delay performance and throughput.