数据结构课程设计



车厢调度

一、需求分析

1、用编号依次为1，2，3，……，n表示停在铁路调度站入口处的车厢序列。

2、用一个栈形象地表示为火车的调度站。

3、利用栈先进后出的性质，结合递归和回溯算法，实现编号1…n的车厢的所有可能的序列和每种序列的出入栈变化过程。

本程序用C语言实现，已经在TURBOC 2.0环境下通过。-Data structure the curriculum design of a train scheduling, needs analysis 1, followed by numbers 1,2,3, ... ..., n that stopped at the railway station at the entrance to the train scheduling sequence. 2, the image of a stack that station for the train scheduling. 3, after the use of a stack of advanced nature, combining recursive and backtracking algorithms, to achieve No. 1 ... n the carriage of all possible sequences and each sequence of changes in the process of access to the stack. This procedure using C language has been adopted TURBOC 2.0 environment.