-
Notifications
You must be signed in to change notification settings - Fork 0
/
fastAPI.py
216 lines (177 loc) · 7.47 KB
/
fastAPI.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
from fastapi import FastAPI, HTTPException, logger
from fastapi.middleware.cors import CORSMiddleware
from pydantic import BaseModel
from AStarAlgorithm import *
from typing import List
import time
import GBFSAlgorithm as GA
import DijkstraAlgorithm as DA
import getfromgraph as gfg
import timeit
app = FastAPI()
app.add_middleware(
CORSMiddleware,
allow_origins=["*"],
allow_credentials=True,
allow_methods=["*"],
allow_headers=["*"],
)
doc = {}
with open("data\QTGfull.graphml", "r", encoding="utf-8") as fd:
doc = xmltodict.parse(fd.read())
path = "data\QTGfull.graphml"
G = gfg.getgraph(path)
file_path = "data\QTGfull.graphml"
nodes, edges = load_graphml(file_path)
class PathResponse(BaseModel):
path: List[tuple]
cost: float
computation_time: float
numbers_of_moved_nodes: int
class PointData(BaseModel):
pntdata: str
path_find_algo: str
near_node_algo: str
@app.get("/")
def read_root():
return {"Hello": "World"}
@app.get("/finding_path")
async def Path_finding(pntdata: str, path_find_algo: str, near_node_algo: str):
try:
raw_input = pntdata.split(",")
# Validate input format
if len(raw_input) != 4:
raise ValueError("Invalid input format")
input_source_loc = (float(raw_input[0]), float(raw_input[1]))
input_dest_loc = (float(raw_input[2]), float(raw_input[3]))
# mapped_source_loc = getKNN(input_source_loc, doc)
# mapped_dest_loc = getKNN(input_dest_loc, doc)
if near_node_algo == "getKNN":
mapped_source_loc = getKNN(input_source_loc, doc)
mapped_dest_loc = getKNN(input_dest_loc, doc)
elif near_node_algo == "near_edge_node":
mapped_source_loc = findNearNodeidForstart(
input_source_loc[0], input_source_loc[1], G
)
mapped_dest_loc = findNearNodeidForfinish(
input_dest_loc[0], input_dest_loc[1], G
)
else:
raise ValueError("Invalid input format")
source_node_id = getOSMId(mapped_source_loc[0], mapped_source_loc[1], doc)
destination_node_id = getOSMId(mapped_dest_loc[0], mapped_dest_loc[1], doc)
s = timeit.default_timer()
match path_find_algo:
case "Astar":
final_path, moved_nodes = astar(
nodes, edges, source_node_id, destination_node_id
)
case "Dijkstra":
final_path, moved_nodes = DA.DSearch(
G, source_node_id, destination_node_id
)
case "GBFS":
final_path, moved_nodes = GA.GBFSearch(
G, source_node_id, destination_node_id
)
case _:
raise ValueError("Invalid input format")
cost = calculate_path_cost(edges, final_path, doc)
path_strings = [latlon for latlon in final_path]
# cost += haversine(input_source_loc, (final_path[0][0], final_path[0][1]))
# cost += haversine(input_dest_loc, (final_path[-1][0], final_path[-1][1]))
execute_time = timeit.default_timer() - s
return PathResponse(
path=path_strings,
cost=cost,
computation_time=execute_time,
numbers_of_moved_nodes=moved_nodes,
)
except Exception as e:
raise HTTPException(status_code=500, detail=str(e))
# @app.get("/astar")
# async def A_Star(pntdata: str):
# try:
# raw_input = pntdata.split(",")
# # Validate input format
# if len(raw_input) != 4:
# raise ValueError("Invalid input format")
# input_source_loc = (float(raw_input[0]), float(raw_input[1]))
# input_dest_loc = (float(raw_input[2]), float(raw_input[3]))
# # mapped_source_loc = getKNN(input_source_loc, doc)
# # mapped_dest_loc = getKNN(input_dest_loc, doc)
# mapped_source_loc = findNearNodeidForstart(
# input_source_loc[0], input_source_loc[1], G
# )
# mapped_dest_loc = findNearNodeidForfinish(
# input_dest_loc[0], input_dest_loc[1], G
# )
# source_node_id = getOSMId(mapped_source_loc[0], mapped_source_loc[1], doc)
# destination_node_id = getOSMId(mapped_dest_loc[0], mapped_dest_loc[1], doc)
# s = timeit.default_timer()
# final_path, moved_nodes = astar(
# nodes, edges, source_node_id, destination_node_id
# )
# cost = calculate_path_cost(edges, final_path, doc)
# path_strings = [latlon for latlon in final_path]
# execute_time = timeit.default_timer() - s
# return PathResponse(
# path=path_strings,
# cost=cost,
# computation_time=execute_time,
# numbers_of_moved_nodes=moved_nodes,
# )
# except Exception as e:
# raise HTTPException(status_code=500, detail=str(e))
# @app.get("/dijkstra")
# async def Dijikstra(pntdata: str):
# try:
# raw_input = pntdata.split(",")
# # Validate input format
# if len(raw_input) != 4:
# raise ValueError("Invalid input format")
# input_source_loc = (float(raw_input[0]), float(raw_input[1]))
# input_dest_loc = (float(raw_input[2]), float(raw_input[3]))
# mapped_source_loc = getKNN(input_source_loc, doc)
# mapped_dest_loc = getKNN(input_dest_loc, doc)
# source_node_id = getOSMId(mapped_source_loc[0], mapped_source_loc[1], doc)
# destination_node_id = getOSMId(mapped_dest_loc[0], mapped_dest_loc[1], doc)
# s = time.time()
# final_path, moved_nodes = DA.DSearch(G, source_node_id, destination_node_id)
# cost = calculate_path_cost(edges, final_path, doc)
# path_strings = [latlon for latlon in final_path]
# execute_time = time.time() - s
# return PathResponse(
# path=path_strings,
# cost=cost,
# computation_time=execute_time,
# numbers_of_moved_nodes=moved_nodes,
# )
# except Exception as e:
# raise HTTPException(status_code=500, detail=str(e))
# @app.get("/gbfs")
# async def GBFS(pntdata: str):
# try:
# raw_input = pntdata.split(",")
# # Validate input format
# if len(raw_input) != 4:
# raise ValueError("Invalid input format")
# input_source_loc = (float(raw_input[0]), float(raw_input[1]))
# input_dest_loc = (float(raw_input[2]), float(raw_input[3]))
# mapped_source_loc = getKNN(input_source_loc, doc)
# mapped_dest_loc = getKNN(input_dest_loc, doc)
# source_node_id = getOSMId(mapped_source_loc[0], mapped_source_loc[1], doc)
# destination_node_id = getOSMId(mapped_dest_loc[0], mapped_dest_loc[1], doc)
# s = time.time()
# final_path, moved_nodes = GA.GBFSearch(G, source_node_id, destination_node_id)
# cost = calculate_path_cost(edges, final_path, doc)
# path_strings = [latlon for latlon in final_path]
# execute_time = time.time() - s
# return PathResponse(
# path=path_strings,
# cost=cost,
# computation_time=execute_time,
# numbers_of_moved_nodes=moved_nodes,
# )
# except Exception as e:
# raise HTTPException(status_code=500, detail=str(e))