FibHeaps/FibHeap.java at master · JoshSharpe/FibHeaps · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

public class FibHeap
{

private FibNode min;
private int count;
private LinkedList rootList;

public
FibHeap()
{
    min = null;
    count = 0;
    rootList = new LinkedList();
}

public FibNode
getMin()
{
    return this.min;
}

public int
getCount()
{
    return this.count;
}

public LinkedList
getRootList()
{
    return this.rootList;
}

public void
insert(FibNode newNode)
{
    if(this.min == null)
    {
        this.rootList.addToFront(newNode);
        this.min = newNode;
    }
    else
    {
        this.rootList.addToFront(newNode);
        if(newNode.getValue() < this.min.getValue())
        {
            this.min = newNode;
        }
    }

    this.count++;
}

/*
public FibNode
findMin()
{

}

public FibNode
extractNode()
{

}

public FibHeap
union(FibHeap h1, FibHeap h2)
{

}

public void
decreaseKey(FibNode node, int newVal)
{

}

public void
delete(FibNode node)
{

}
*/

}//end class