Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов. ×

MinCost Max Flow — help

Правка en1, от nunes, 2017-07-16 14:55:47

Hey guys,

I'm studying mincost max flow algorithm based on this(https://www.topcoder.com/community/data-science/data-science-tutorials/minimum-cost-flow-part-one-key-concepts/) tutorial of TopCoder, but i can't understand how to calculate the potential of a node, and how to recalculate it after a flow have been found on a certain transformed network.

Can somebody give me a better explanation about node potentials and how to calculate it on mincost max flow algorithm? (Some example code would help a lot too)

Теги #network flow, #mincost flow, #graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский nunes 2017-07-16 14:55:47 541 Initial revision (published)