The maximum flow problem based on contact graph in DTN is very important for routing and data planning. Common topological graphs with non-sequential changes include Dinic, ISAP and other deterministic algorithms for solving the maximum flow between two nodes. But these algorithms cannot be directly applied to topological networks with time series changes. At present, Iosifidis.G has given a solution to this problem based on the time expansion graph, but his method requires high storage space, and the increase in the number of nodes means increasing high time complexity accordingly.