s434681/praca_magisterska
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added presentation of implementaions.

Browse Source
This commit is contained in:
Bartosz 2021-11-15 15:01:34 +01:00
parent 85995b3d16
commit 8c680e235e
5 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
Documentation/Referat___praca_magisterska_2.pdf Normal file
View File

Binary file not shown.

3
algorithms/a_star.py
View File

@ -68,7 +68,8 @@ if __name__ == "__main__":
(3, 1): 4,
(6, 2): 3,
(8, 6): 8,
(8, 3): 2
(8, 3): 2,
(9, 1): 8
}
v = dict()

5
algorithms/bidirectional.py
View File

@ -139,7 +139,8 @@ if __name__ == "__main__":
(3, 1): 4,
(6, 2): 3,
(8, 6): 8,
(8, 3): 2
(8, 3): 2,
(9, 1): 8
}
v = dict()
@ -147,4 +148,4 @@ if __name__ == "__main__":
v[i[0]] = []
v[i[1]] = []
print(bidirectional_algorithm(g, v, 7, 8, heuristic_cost))
print(bidirectional_algorithm(g, v, 7, 10, heuristic_cost))

0
dataset/deezer_clean_data/HR_edgeswith_weight.csv → dataset/deezer_clean_data/HR_edges_with_weight.csv
View File

Can't render this file because it is too large.

2
main.py
View File

@ -4,7 +4,7 @@ import algorithms.a_star as a_star
import algorithms.bidirectional as bidirectional
if __name__ == '__main__':
g = op_file.read_graph_from_file("dataset/deezer_clean_data/HR_edgeswith_weight.csv", has_weight=True)
g = op_file.read_graph_from_file("dataset/deezer_clean_data/HR_edges_with_weight.csv", has_weight=True)
v = dict()
for i in g.keys():
v[i[0]] = []