My question is related to flows and network coding problem. 

Assume to have a network (multiple source multiple sinks) where the max flow is not unique, meaning that it can be obtained in different ways, in this case different network coding policy can be admitted. 

Classical algorithms are not able to distinguish those different cases. Am i right?

Thanks to everybody

Gianni