Functional programming and non-distributivity in pathfinding problems

Standard approaches for finding the cost and the path of problems in graphs are based on algorithms relying the fulfilment of certain algebraic properties such associativity and distributivity, for instance the multiplication of matrices. This thesis presents an investigation on the implementation o...

Full description

Bibliographic Details
Main Author: Saenz Carrasco, Juan Carlos
Format: Thesis (University of Nottingham only)
Language:English
Published: 2016
Online Access:http://eprints.nottingham.ac.uk/35183/
http://eprints.nottingham.ac.uk/35183/1/4159723.pdf