作者: F P Clerq
DOI:
关键词:
摘要: A method is described for finding the shortest route through a public transport network. The algorithm used an extension of once-through algorithm. Before solution presented characteristics Moore and are mentioned difficulties related assumptions concerning search routes network analyzed. Reference made to methods developed elsewhere solve these difficulties. An outline given program package in which incorporated. /TRRL/