-
May 14th, 2011, 08:21 PM
#1
Fibonacci Heap Question
Can someone explain why cascading cuts are done during deleteArbitrary and reweightNode operations? I'm sure there is a good reason and I'd like to understand it.
-
May 14th, 2011, 09:07 PM
#2
Re: Fibonacci Heap Question
Originally Posted by ClaytonWohl
Can someone explain why cascading cuts are done during deleteArbitrary and reweightNode operations? I'm sure there is a good reason and I'd like to understand it.
And many still wonder why Captain Picard failed to understand the threat of the Borg right?
Just kidding but maybe you should explain your problem a little bit better.
Last edited by nuzzle; May 16th, 2011 at 02:08 AM.
-
May 16th, 2011, 09:45 AM
#3
Re: Fibonacci Heap Question
What's a 'delereArbitrary' operation? What's a 'reweightNode' operation?
Viggy
-
May 16th, 2011, 04:10 PM
#4
Re: Fibonacci Heap Question
"deleteArbitrary" is when you delete an arbitrary node from the heap. reweightNode is when you change the weight (or ordering value) of an existing heap node.
I take it that you don't know the answer to my question.
-
May 16th, 2011, 04:22 PM
#5
Re: Fibonacci Heap Question
As nuzzle alluded to, you need to be a little more specific. These functions are not in any standard library I've had to work with. They are not part of the standard C/C++ library:
Code:
> man deleteArbitrary
No manual entry for deleteArbitrary
...
> man reweightNode
No manual entry for reweightNode
Also, a "heap", for client (i.e. programmer) use is not standard as well.
Viggy
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|