Skip to content
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.

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

Fix Fibonacci Heap Bug #5

Open
nishantc1527 opened this issue May 12, 2020 · 0 comments
Open

Fix Fibonacci Heap Bug #5

nishantc1527 opened this issue May 12, 2020 · 0 comments

Comments

@nishantc1527
Copy link
Owner

It has come to my attention that the Fibonacci Heap has a bug, specifically when you chain the extract min method. Here is a test that doesn't work:

    for(int i = 0; i < 100; i ++) {
        heap.insert(i);
    }

    int count = 0;

    while(!heap.isEmpty()) {
        assertEquals(count ++, heap.extractMin());
    }

It would be nice if you could fix it.

Points: 20

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant