Skip to content

Optimized PairingHeap.Extract #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Optimized PairingHeap.Extract #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 10 additions & 19 deletions pairing-heap-csharp/PairingHeap.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -107,39 +107,30 @@ private PairingNode<T> Link(PairingNode<T> node1, PairingNode<T> node2)

private PairingNode<T> Extract(PairingNode<T> node)
{
var children = new List<PairingNode<T>>();
if (node.Child is null)
return null;

PairingNode<T> result = null;

var n = node.Child;
while (!object.ReferenceEquals(n, null))
{
if (n.Sibling is null)
return Link(result, n);

var pair = n.Sibling;
n.Parent = null;
n.Sibling = null;
if (object.ReferenceEquals(pair, null))
{
children.Add(n);
break;
}

var next = pair.Sibling;
pair.Parent = null;
pair.Sibling = null;
children.Add(Link(n, pair));
n = next;
}
result = Link(result, Link(n, pair));

if (children.Count == 0)
{
return null;
}

var root = children[0];
for (var i = 1; i < children.Count; ++i)
{
root = Link(root, children[i]);
n = next;
}

return root;
return result;
}

public int Count
Expand Down