Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
257 views
in Technique[技术] by (71.8m points)

怎么匹配最接近的线路

给定若干巴士线路,让用户选择起点和终点,则么匹配到最合适(巴士途径点最接近用户选择的起点和终点)的线路?如果要排序呢?


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Answer

0 votes
by (71.8m points)

关键词 GraphShortest path

具体的实现首先要建一个图,选择一个合适的算法,关键词 BFS, Dijkstra, A*


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...