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}}

=={{header|Nim}}==

{{trans|Go & Kotlin}}

type

echo "(deleting $#)" % node.value

heap.delete(node)

{{out}}

=={{header|Phix}}==

{{trans|Go}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">enum</span> <span style="color: #000000;">VALUE</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">PARENT</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">CHILD</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">PREV</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">NEXT</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">RANK</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">MARK</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">NODELEN</span><span style="color: #0000FF;">=$</span>

<span style="color: #000000;">h</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">Delete</span><span style="color: #0000FF;">(</span><span style="color: #000000;">h</span><span style="color: #0000FF;">,</span><span style="color: #000000;">x</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">Vis</span><span style="color: #0000FF;">(</span><span style="color: #000000;">h</span><span style="color: #0000FF;">)</span>

{{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}}