16 lines
542 B
Python
16 lines
542 B
Python
import tools.file_service as op_file
|
|
import algorithms.dijkstra as dijkstra
|
|
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_edges_with_weight.csv", has_weight=True)
|
|
v = dict()
|
|
for i in g.keys():
|
|
v[i[0]] = []
|
|
v[i[1]] = []
|
|
|
|
# print(dijkstra.dijkstra_algorithm(g, v, 0, 4))
|
|
# print(a_star.a_star_algorithm(g, v, 0, 4))
|
|
# print(bidirectional.bidirectional_algorithm(g, v, 0, 4))
|