Year: 2005
Type: report
Abstract: We construct a readable, compact and efficient implementation of Dijkstra's shortest path algorithm and Fibonacci heaps using Constraint Handling Rules (CHR), which is increasingly used as a high-level rule-based general-purpose programming language. We measure its performance in different CHR systems, investigating both the theoretical asymptotic complexity and the constant factors realized in practice.
Source: Lirias
Authors: Sneyers, Jon, Schrijvers, Tom, Demoen, Bart
Institution: KU Leuven
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Vlaamse regering
OpenAlex ID: W199254071
