AF-heap
id:
af-heap-248-14180678
title:
AF-heap
text:
In computer science, the AF-heap is a type of priority queue for integer data, an extension of the fusion tree using an atomic heap proposed by M. L. Fredman and D. E. Willard. Using an AF-heap, it is possible to perform m insert or decrease-key operations and n delete-min operations on machine-integer keys in time O(m + n log n / log log n). This allows Dijkstra's algorithm to be performed in the same O(m + n log n / log log n) time bound on graphs with n edges and m vertices, and leads to a li
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/AF-heap
date created:
date modified:
2024-04-22T05:50:51Z
main entity:
{"identifier":"Q4651388","url":"https://www.wikidata.org/entity/Q4651388"}
image:
fields total:
13
integrity:
13