<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://nick-black.com/dankwiki/index.php?action=history&amp;feed=atom&amp;title=Fibonacci_Heap</id>
	<title>Fibonacci Heap - revision history</title>
	<link rel="self" type="application/atom+xml" href="https://nick-black.com/dankwiki/index.php?action=history&amp;feed=atom&amp;title=Fibonacci_Heap"/>
	<link rel="alternate" type="text/html" href="https://nick-black.com/dankwiki/index.php?title=Fibonacci_Heap&amp;action=history"/>
	<updated>2026-07-11T16:31:12Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.46.0</generator>
	<entry>
		<id>https://nick-black.com/dankwiki/index.php?title=Fibonacci_Heap&amp;diff=5062&amp;oldid=prev</id>
		<title>Dank: Created page with &quot;Developed by Fredman and Tarjan from 1984--1987, this heap of trees provides an efficient data structure used in many algorithms.  CATEGORY: Computer Science Eponyms&quot;</title>
		<link rel="alternate" type="text/html" href="https://nick-black.com/dankwiki/index.php?title=Fibonacci_Heap&amp;diff=5062&amp;oldid=prev"/>
		<updated>2012-08-13T17:10:59Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Developed by Fredman and Tarjan from 1984--1987, this heap of &lt;a href=&quot;/dankwiki/index.php?title=Trees&quot; title=&quot;Trees&quot;&gt;trees&lt;/a&gt; provides an efficient data structure used in many algorithms.  &lt;a href=&quot;/dankwiki/index.php?title=Category:Computer_Science_Eponyms&quot; class=&quot;mw-redirect&quot; title=&quot;Category:Computer Science Eponyms&quot;&gt;CATEGORY: Computer Science Eponyms&lt;/a&gt;&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Developed by Fredman and Tarjan from 1984--1987, this heap of [[trees]] provides an efficient data structure used in many algorithms.&lt;br /&gt;
&lt;br /&gt;
[[CATEGORY: Computer Science Eponyms]]&lt;/div&gt;</summary>
		<author><name>Dank</name></author>
	</entry>
</feed>