# name
Pathfinding algorithms in graphs and applications

# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny

# metadata.dc.description.abstract[].value
[en] The aim of this work is to give a rigorous mathematical insight of the most popular pathfinding algorithms, focusing on $A{∗}$ and trying to understand how the heuristic it uses affects its correctness and performance. We complement this theoretical study of the algorithms with experimental results found by running two benchmarks of the algorithms using a simulator of the algorithms built for this project.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Daniel Monzonís Laparra, 2019

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques

# metadata.dc.title[].value
Pathfinding algorithms in graphs and applications