The maximum flow in network involves sending the maximum amount of material from a specified source vertex s to another specified sink vertex t, subject to capacity restrictions on the amount of material that can flow along each path.A closely related we formed a new concept of -closure space and -interior space using subgraphs generated by Ford-Fulkerson algorithm steps, also we induced some new topological properties .