Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (3): 219-221.DOI: 10.3778/j.issn.1002-8331.2010.03.067
• 工程与应用 • Previous Articles Next Articles
MOU Lian-ming
Received:
Revised:
Online:
Published:
Contact:
牟廉明
通讯作者:
Abstract: Firstly,in allusion to shortage in the public traffic system,the design method of optimum nonstop matrix is brought forward after the self-determining inquiry of public traffic is analyzed detailedly.Secondly,the transfer operator is designed and the judgment method of optimum aim is given.Thirdly,because nonstop matrix is the typical sparse-matrix,the efficient transfer arithmetic is designed after the large-scale nonstop matrix is transformed to the cross chain-list and the matrix transfer operation is transformed to the intersection operation of chain-list.Lastly,the validity of arithmetic is testified by an instance.Public traffic self-determining inquiry is effectively solved.
摘要: 针对目前公交查询系统存在的不足,分析了公交查询的自主性,给出了最优直达矩阵的构造方法;设计了换乘算子并给出最优目标判断方法;利用直达矩阵是一个典型的稀疏矩阵,将大型直达矩阵转化为十字链表,将矩阵的换乘运算转化为链表的交集运算,设计了高效的换乘算法;最后应用实例验证了算法的有效性,全面有效地解决了公交自主查询问题。
CLC Number:
P208
MOU Lian-ming. Public traffic self-determining inquiry based on optimum nonstop matrix[J]. Computer Engineering and Applications, 2010, 46(3): 219-221.
牟廉明. 基于最优直达矩阵的公交自主查询[J]. 计算机工程与应用, 2010, 46(3): 219-221.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.03.067
http://cea.ceaj.org/EN/Y2010/V46/I3/219