Bottleneck analysis of the generalized networks

Network simplex algorithm is an effective algorithm for the generalized network, which gains negative cost graphs by constructing augmented forest structure, and then augments flows on the negative cost graphs. Bottleneck structure is presented based on the augmented forest structure in this paper, then negative cost augmented networks are constructed, the arcs that block the negative cost augmented network are the elements of the bottleneck. The bottleneck analysis of the whole network is completed by decomposing the network. An example is presented in the end.