On the algorithm of the network maximal flow, the paper provides a method of achieving it. The concrete procedure is to achieve the algorithm by using stack and structural array. First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on. Afterwards the labeling method is adopted to find the augmenting chain according to the adjacency list. In the process, some spots are stored in the stack by means of the depth superior traverse and range superior traverse and the course way is also conserved in the array. Keep on doinh this till the maximum flow and the flow of each arc are all found.