本文提出一种在有向图中求全部有向哈密尔顿回路的新算法。
In this paper a new algorithm for finding all directed Hamiltonian circuits in a digraph is presented.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
By using Hamilton graph, the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
By using Hamilton graph, the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
应用推荐