def JudgeTwoWay(wayid1,wayid2):
"""
判断两个相邻有交点路段是否能够互通，即从way1 是否能到达way2
注意：此部分只判断有交点的两个路段 没有交点的两个路段会直接判断为不能互通
思路：
1、无交点，判定为不通，两个路段ID相同，判定为相通
2、
:param wayid1:
:param wayid2:
:return:
"""
if wayid1==wayid2:
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
node_id = TwoWay_intersection(wayid1, wayid2) # 两条路段交点
if not node_id: #两个路段没有交点
return False
try:
wayid1_oneway_flag = Getway_Direction(wayid1) # 标记wayid1是否为单向
wayid2_oneway_flag = Getway_Direction(wayid2) # 标记wayid2是否为单向
wayslist1 = Get_way_NodeID(wayid1)
wayslist2 = Get_way_NodeID(wayid2) # 示例：[320524866, 2207731964, 320524867]
index = wayslist2.index(node_id[0][0]) # node_id[0][0]为取出交点 node_id为嵌套元组
if wayid1_oneway_flag == 0 and wayid2_oneway_flag == 0:
# 两个路段均为双向
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
elif wayid1_oneway_flag == 1 and wayid2_oneway_flag == 0: # wayid1 为单向 wayid2 为双向
# wayid1为单向 wayid2为双向
if wayslist1.index(node_id[0][0]) == 0: # 交点为wayid1的第一个点
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 0)
return False
else:
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
elif wayid1_oneway_flag == 0 and wayid2_oneway_flag == 1: # wayid1 为双向 wayid2 为单向
if index == len(wayslist2) - 1: # 交点是way2的最后一个点，那么即使way1 way2有交点，则way1也是无法到达way2的
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 0)
return False
else:
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
else:
# 两个路段均为单向
if index == len(wayslist2) - 1: # 交点是way2的最后一个点，那么即使way1 way2有交点，则way1也是无法到达way2的
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 0)
return False
elif wayslist1.index(node_id[0][0]) == 0 and wayslist2.index(node_id[0][0]) == 0: # 交点同时是way1 way2的第一个点
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
elif wayslist1.index(node_id[0][0]) == 0: # 交点是way1的第一个点
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 0)
return False
else:
Common_Functions.SaveRoutesConn("connects", wayid1, wayid2, 1)
return True
except:
return False
def Nodirectionwaytoway(way_id1,way_id2,max_sum=8):
"""
无方向 有交点就会认为通行
:param way_id1:
:param way_id2:
:param max_sum:
:return:
"""
if way_id1 == way_id2:
return [way_id1,way_id2]
finalroute = []
node_id = TwoWay_intersection(way_id1, way_id2) #两条路段交点
if node_id:
if JudgeTwoWay(way_id1,way_id2):
finalroute.extend([way_id1, way_id2])
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 1)
return finalroute
else:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
else:
#两条路段没有直接交点
Candidate_Routes = [[way_id1]] # 候选路线
flag = 0
count = 0 #迭代多少次之后仍然没有找到可行路线，则认为不可走
exitflag = 0 #标记是否是通过找到满足条件的路线而退出的
grid1 = Getway_startendnode_grid(way_id1,flag=0)
startx = grid1[0]
starty = grid1[1]
grid2 = Getway_startendnode_grid(way_id1, flag=0)
Endx = grid2[0]
Endy = grid2[1]
while True:
temCandidate_Routes = [] # 存储当前这一轮新的候选路线
AllNextways = []
MaxDel = [] #存因路段数目大于阈值，而筛除的路线
for sub in Candidate_Routes:
if way_id2 in sub:
flag = 1
break
if len(sub) > max_sum: #防止寻找时间过长，如果目的是为了查找路线，可将此条件删除
MaxDel.append(sub)
for sub in MaxDel:
Candidate_Routes.remove(sub)
if len(Candidate_Routes)==0:
flag = 1
exitflag = 1
if count==8:
flag=1
exitflag = 1
if flag == 1:
break
for subroute in Candidate_Routes:
# subroute 表示正在处理的路线
preways = subroute #表示当前路线已有的路段
processingway = subroute[-1] # 表示要处理的路段
nextway = NodirectionFindNextWay(processingway,preways) # 下一步的可选路段
if len(nextway)==0:
#当前路线下一步没有能走的路
pass
else:
AllNextways.extend(nextway)
for next in nextway:
temroute = copy.deepcopy(subroute)
temroute.append(next)
temCandidate_Routes.append(temroute)
count += 1
Candidate_Routes.clear()
Candidate_Routes = temCandidate_Routes
Candidate_Routes = Common_Functions.Double_layer_list(Candidate_Routes)
Candidate_Routes = Common_Functions.Main_Auxiliary_road(Candidate_Routes) # 去除头尾路段一样的候选路线
Candidate_Routes = Common_Functions.Start_End(Candidate_Routes) # 对于[wayid1,wayid2,wayid3] [wayid1,wayid4,wayid5,wayid3] 去除路段多的,如果包含路段数量一致 暂不处理
Candidate_Routes = Common_Functions.Sequential_subset(Candidate_Routes) # 最后去前缀
#print(len(Candidate_Routes))
delsub = []
for sub in Candidate_Routes:
#判断行驶方向
secondgrid = Getway_startendnode_grid(sub[-1], flag=0)
if secondgrid:
curx = secondgrid[0]
cury = secondgrid[1]
if Endx > startx and Endy>starty: #路段way_id2 在way_id1 的右上部
if curx < startx and cury < starty:
delsub.append(sub) #此路线方向向左下部走 删除此路线
if Endx > startx and Endy < starty: # 路段way_id2 在way_id1 的右下部
if curx < startx and cury > starty:
delsub.append(sub) # 此路线方向向左上部走 删除此路线
if Endx <startx and Endy < starty: # 路段way_id2 在way_id1 的左下部
if curx > startx and cury > starty:
delsub.append(sub) # 此路线方向向右上部走 删除此路线
if Endx < startx and Endy > starty: # 路段way_id2 在way_id1 的左上部
if curx > startx and cury < starty:
delsub.append(sub) # 此路线方向向右上部走 删除此路线
else:
delsub.append(sub)
for sub in Common_Functions.Double_layer_list(delsub):
Candidate_Routes.remove(sub)
#print(len(Candidate_Routes))
if len(AllNextways)==0:
#所有的候选路线都没有下一步路可走
flag=1
exitflag = 1
minnum = float("inf")
if exitflag==1:
#证明是循环跳出不是因为找到路径跳出的
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
Deleteways = []
#print(Candidate_Routes)
for sub in Candidate_Routes:
#由于以上为没有方向的判断，所以在此循环中要加入方向的判断
if way_id2 in sub:
if len(sub)==1:
return sub
elif len(sub)==2 and JudgeTwoWay(sub[0],sub[1]):
pass
elif len(sub) >= 3 and JudgeLines(sub):
pass
else:
Deleteways.append(sub)
else:
Deleteways.append(sub)
if len(Deleteways)!=0:
for delsub in Common_Functions.Double_layer_list(Deleteways):
Candidate_Routes.remove(delsub)
if len(Candidate_Routes)==0:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
for sub in Candidate_Routes:
if way_id2 in sub:
if len(sub) < minnum:
finalroute = sub
minnum = len(sub)
else:
pass
if len(finalroute)==0:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2,0)
return False
else:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 1)
return finalroute
def waytoway(way_id1,way_id2,max_num=8):
"""
实现从way_id1到way_id2的路线规划,当此函数完全用作简易导航，可设置max_num为无穷
设置 max_num 与Count 的原因为防止查找完全不通的两个路段而耗费过长的时间
有方向通行
问题：即使很近的两个路段（实际短距离不能通行），但是会花费较多的时间去判断是否能通行
47574526,403874395两个路段不能互通 但是只在北野场桥一部分就花费了5分钟去判断可行性
:param way_id1:
:param way_id2:
:return:
首先判断两个路段是否有交集，有交集则这两条路不需要经过其他路线的连接
"""
if way_id1 == way_id2:
return [way_id1,way_id2]
finalroute = []
node_id = TwoWay_intersection(way_id1, way_id2) #两条路段交点
if node_id:
if JudgeTwoWay(way_id1,way_id2):
finalroute.extend([way_id1, way_id2])
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 1)
return finalroute
else:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
else:
#两条路段没有直接交点
Candidate_Routes = [[way_id1]] # 候选路线
flag = 0
count = 0 # 迭代多少次之后仍然没有找到可行路线，则认为不可走
exitflag = 0 #标记是否是通过找到满足条件的路线而退出的
grid1 = Getway_startendnode_grid(way_id1, flag=0)
startx = grid1[0]
starty = grid1[1]
grid2 = Getway_startendnode_grid(way_id1, flag=0)
Endx = grid2[0]
Endy = grid2[1]
startendwaydis = twoway_distance(way_id1, way_id2)+ 0.01 # 加1000米弹性范围，0.0003为30米
while True:
print(Candidate_Routes)
temCandidate_Routes = [] # 存储当前这一轮新的候选路线
AllNextways = []
print(count)
for subroute in Candidate_Routes:
# subroute 表示正在处理的路线
processingway = subroute[-1] # 表示要处理的路段
wayflag,nextway = FindNextWay(processingway,subroute,way_id2) # 下一步的可选路段
#wayflag为FALSE 标记wayid2在nextway，但是由于方向问题，被删除，所以直接判定为不通
if not wayflag:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
if len(nextway) == 0:
# 当前路线下一步没有能走的路
pass
else:
AllNextways.extend(nextway)
for next in nextway:
temroute = copy.deepcopy(subroute)
temroute.append(next)
temCandidate_Routes.append(temroute)
if len(AllNextways)==0:
#所有的候选路线都没有下一步路可走
flag=1
exitflag = 1
count += 1
Candidate_Routes.clear()
Candidate_Routes = temCandidate_Routes
Candidate_Routes = Common_Functions.Double_layer_list(Candidate_Routes)
Candidate_Routes = Common_Functions.Main_Auxiliary_road(Candidate_Routes) # 去除头尾路段一样的候选路线
Candidate_Routes = Common_Functions.Start_End(Candidate_Routes) # 对于[wayid1,wayid2,wayid3] [wayid1,wayid4,wayid5,wayid3] 去除路段多的,如果包含路段数量一致 暂不处理
Candidate_Routes = Common_Functions.Sequential_subset(Candidate_Routes) # 最后去前缀
delsub = []
for sub in Candidate_Routes:
if way_id2 in sub:
flag = 1
break
if len(Candidate_Routes) == 0:
flag = 1
exitflag = 1
if count == max_num:
flag = 1
exitflag = 1
if flag == 1:
break
for sub in Candidate_Routes:
if len(sub) >= 3:
if JudgeLines(sub): # 判断当前路线是否能通
for i in combinations(sub,2):
Common_Functions.SaveRoutesConn("connects", i[0],i[1], 1)
elif not JudgeLines(sub) and way_id2 in sub: # 目标路段在子路线中 但是不能走通
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
else:
delsub.append(sub)
continue
elif len(sub) == 2:
if JudgeTwoWay(sub[0], sub[1]):
Common_Functions.SaveRoutesConn("connects", sub[0], sub[1], 1)
pass
elif JudgeTwoWay(sub[0], sub[1]) and way_id2 in sub: # 目标路段在子路线中 但是不能走通
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
else:
delsub.append(sub)
continue
else:
pass
for sub in Candidate_Routes:
# 判断行驶方向
secondgrid = Getway_startendnode_grid(sub[-1], flag=0)
if secondgrid:
curx = secondgrid[0]
cury = secondgrid[1]
if Endx > startx and Endy > starty: # 路段way_id2 在way_id1 的右上部
if abs(startx - curx) <= 5 or abs(starty - cury) <= 5: # 防止道路过近，出现偏差，方向加500米偏差
pass
elif curx <= startx and cury <= starty:
delsub.append(sub) # 此路线方向向左下部走 删除此路线
if Endx > startx and Endy < starty: # 路段way_id2 在way_id1 的右下部
if abs(startx - curx) <= 5 or abs(starty - cury) <= 5: # 防止道路过近，出现偏差，方向加500米偏差
pass
elif curx < startx and cury > starty:
delsub.append(sub) # 此路线方向向左上部走 删除此路线
if Endx < startx and Endy < starty: # 路段way_id2 在way_id1 的左下部
if abs(startx - curx) <= 5 or abs(starty - cury) <= 5: # 防止道路过近，出现偏差，方向加500米偏差
pass
elif curx > startx and cury > starty:
delsub.append(sub) # 此路线方向向右上部走 删除此路线
if Endx < startx and Endy > starty: # 路段way_id2 在way_id1 的左上部
if abs(startx - curx) <= 5 or abs(starty - cury) <= 5: # 防止道路过近，出现偏差，方向加500米偏差
pass
elif curx > startx and cury < starty:
delsub.append(sub) # 此路线方向向右上部走 删除此路线
else:
pass
temstaryendwaydis = twoway_distance(way_id1, sub[-1])
if temstaryendwaydis > startendwaydis:
delsub.append(sub)
for sub in Common_Functions.Double_layer_list(delsub):
Candidate_Routes.remove(sub)
if exitflag==1:
#证明是循环跳出不是因为找到路径跳出的
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
Deleteways = []
for sub in Candidate_Routes:
if way_id2 in sub:
if len(sub) == 1:
return sub
elif len(sub) == 2 and JudgeTwoWay(sub[0], sub[1]):
pass
elif len(sub) >= 3 and JudgeLines(sub):
for i in combinations(sub, 2):
Common_Functions.SaveRoutesConn("connects", i[0], i[1], 1)
pass
else:
Deleteways.append(sub)
else:
Deleteways.append(sub)
if len(Deleteways)!=0:
for delsub in Common_Functions.Double_layer_list(Deleteways):
Candidate_Routes.remove(delsub)
if len(Candidate_Routes)==0:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
minnum = float("inf")
for sub in Candidate_Routes:
if way_id2 in sub:
if len(sub) < minnum:
finalroute = sub
minnum = len(sub)
else:
pass
if len(finalroute)==0:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 0)
return False
else:
Common_Functions.SaveRoutesConn("connects", way_id1, way_id2, 1)
return finalroute