Route search method and route search program

作者: 半田 恵一 , Keiichi Handa

DOI:

关键词:

摘要: PROBLEM TO BE SOLVED: To provide a route search method and program capable of finding not including cheat on the fare in network having stations as nodes expressing between transfer foot with arcs. SOLUTION: The arcs is produced (S101), retrieval condition read (S102), data necessary for are (S103). Then, shortest path tree (S104), plurality paths searched based (S106). In this case, it determined whether included or relative to each candidate (S105). routes found (S107), time allocated (S108), calculated (S109). A high-rank routs selected displayed priority standard (S110). COPYRIGHT: (C)2004,JPO

参考文章(0)