Description: Multi-stage graph G = (V, E) is a directed graph. It has the following characteristics: graph node is divided into k> = 2 disjoint sets Vi, 1 < = i < = k, where V1 and Vk are only one node s (source) and t (Meeting Point ). Figure in all of the edges <u,v> All have the following property: If, then, 1 < = i <k-1,且每条边<u,v> Comes with costs c <u,v> . From s to t, the cost of a path is the path on top of costs and. Multistage Graph Problem is seeking a minimum cost s to t path. Defined by a set figure for each section. Since E was bound, and each path from s to t are from the beginning of paragraph 1, paragraph k in the first end.
To Search:
File list (Check if you may need any files):
multistageplan-向前处理.cpp
multistageplan-向后处理.cpp
Download