摘要
在自动测评中,从考生操作开始到结束,存在多种可能的操作序列。自动测评系统要解决的关键问题之一是提取作为正确答案的最简化的操作序列。Dijkstra算法是计算最短路径的经典算法,本文在对Dijkstra算法分析的基础上,给出找到最简操作序列的解决方案,并通过实例进行说明。该方案是正确评判考生操作的基础,并在MAP210导航仪自动测评系统中得到了验证。
In automatic evaluation there are several possible operation sequences from start to finish of the examinee operation. Extracting the minimal operation sequence as the correct answer is one of the key problems in the automatic evaluation system. Dijkstra algorithm is a classic algorithm for calculating the shortest path. This paper gives the solution of the minimal operation sequence based on the analysis of Dijkstra algorithm, and illustrates by an example. The solution is the foundation to judge correct operation of the examinee, and is been proved in the automatic evaluation system of MAP210 navigators.
出处
《计算机与现代化》
2012年第12期1-3,7,共4页
Computer and Modernization
基金
公安部应用创新计划项目(2011YYCXHJJXY140)
关键词
最短路径算法
自动测评
操作序列
shortest path algorithm
automatic evaluation
operation sequence
