from networkx.algorithms.flow.maxflow import *
from networkx.algorithms.flow.mincost import *
from networkx.algorithms.flow.preflow_push import *
from networkx.algorithms.flow.shortest_augmenting_path import *

del utils

from . import maxflow, mincost, preflow_push, shortest_augmenting_path

__all__ = sum([maxflow.__all__, mincost.__all__, preflow_push.__all__,
               shortest_augmenting_path.__all__], [])

from .maxflow import *
from .mincost import *
from .preflow_push import *
from .shortest_augmenting_path import *

Modify handling of module conflict in shortest augmenting path maxflow
Modify handling of module conflict in shortest augmenting path maxflow

+ from . import maxflow, mincost, preflow_push, shortest_augmenting_path
- from networkx.algorithms.flow.maxflow import *
- from networkx.algorithms.flow.mincost import *
- from networkx.algorithms.flow.preflow_push import *
- from networkx.algorithms.flow.shortest_augmenting_path import *
  
- del utils
+ __all__ = sum([maxflow.__all__, mincost.__all__, preflow_push.__all__,
+                shortest_augmenting_path.__all__], [])
  
+ from .maxflow import *
+ from .mincost import *
+ from .preflow_push import *
+ from .shortest_augmenting_path import *
+ 
Modify handling of module conflict in shortest augmenting path maxflow
## Code Before:
from networkx.algorithms.flow.maxflow import *
from networkx.algorithms.flow.mincost import *
from networkx.algorithms.flow.preflow_push import *
from networkx.algorithms.flow.shortest_augmenting_path import *

del utils

## Instruction:
Modify handling of module conflict in shortest augmenting path maxflow
## Code After:
from . import maxflow, mincost, preflow_push, shortest_augmenting_path

__all__ = sum([maxflow.__all__, mincost.__all__, preflow_push.__all__,
               shortest_augmenting_path.__all__], [])

from .maxflow import *
from .mincost import *
from .preflow_push import *
from .shortest_augmenting_path import *
