It's a suggestion, if there's an inconsistency, plz point it out. So, what if traversal start with max value of used compared to capacity, then after that it selects nxt node based on say highest used/cap ratio in its neighbors and so on, if it reaches a node that doesn't have untraversed neighs, it can backtrack,and u can continue this way endlessly