AF-heap

Encyclopedia : A : AF : AFH : AF-heap

To meet Wikipedia's and make it more accessible to a general audience, this article may require [Cleanupcleanup].
The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help Wikipedia by improving the introduction according to the guidelines laid out at [Guide to layout]. You can discuss the issue on the .

The AF-heap was proposed by Tarjan and Fredman for implementing Dijkstra's algorithm.

Using an AF-heap, a graph having m edges can be inserted into an empty graph of n vertices. The algorithm works with an efficiency of O(m + n log n).

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.