Spatial networks and top k queries assignment in the context of Complex Data Management course Complex Data Management,MYY041
edges.txt : contains edges for the undirected graph that we need,and weights for each of them.
nodes.txt : contains coordinates for each node in graph,needed for calculation of Euclidean distance in A-star algorithm
data.py : There is a script that allow us to organise our input files to a central construction in out.txt file.
python3 data.py nodes.txt edges.txt
dijkstra_a_star.py : There are implementations about Dijkstra and A-star algorithms.A-star contains a expansion in evaluation equation.
python3 dijkstra_a_star.py out.txt 1 10
nra.py :Variation of No-Random-Access algorithm with Dijkstra usage for data input.
python3 nra.py out.txt 1 6 10
Python 3.6.0
MIT