Research on Method of Traffic Network Bottleneck Identification based on Max-flow Min-cut Theorem

Traffic congestion has severely affected the city´s development, therefore, the research on method of traffic network bottleneck identification which can find weak parts of the traffic network and provide a basis for resolving the traffic problem, is becoming very important. The Method of Traffic Network Bottleneck Identification based on Max-flow Min-cut Theorem is simulated and proved available and right by using the data of traffic network of Changyi District, Jilin City.