Fibonacci heap: Difference between revisions

 

=={{header|C++}}==

 

template <class V> struct node {

}

 

 

=={{header|Go}}==

A package. Implementation follows Fredman and Tarjan's 1987 paper.

 

import "fmt"

}

f(h.Node, "")

A demonstration:

 

import (

h.Delete(x)

h.Vis()

{{out}}

<pre>

=={{header|Julia}}==

{{trans|Python}}

 

export FNode, FibonacciHeap, insert, extractmin, findmin, decreasekey, delete!

print(h3)

println("The minimum of h3 is now: ", Minimum(h3).value

<pre>

Made heap 1:

=={{header|Kotlin}}==

{{trans|Go}}

 

class Node<V : Comparable<V>>(var value: V) {

h.delete(x)

h.visualize()

 

{{out}}

</pre>

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

{{out}}

<pre>

 

=={{header|Python}}==

# internal node class

node.right.parent = parent

node.left.right = node.right

 

=={{header|Raku}}==

{{trans|Go & Kotlin}}

 

subset vEle of Any;

say "deleting: ", $x.value;

$h.Delete($x);

{{out}}

<pre>MakeHeap:

{{libheader|Wren-str}}

This just deals with nodes whose values are strings.

 

class Node {

System.print("(deleting '%(x.value)')")

h.delete(x)

 

{{out}}