Jul
26
awarded Yearling
Jul
19
comment What is the intuition behind the Fibonacci heap data structure?
@templatetypedef, I was just confused because I thought that tree means the whole three, while you refer generally to any sub-tree. Besides those implementation issues you've mentioned I foresee another one. On the one hand, to do decrease_key operation efficiently one need to hold a pointer to a node. On the other hand, to delete a node from a circular list one should swap its payload with the next node, i assume. So we actually cannot refer to such node. How this conflict is resolved in a decent implementation?
Jul
18
comment What is the intuition behind the Fibonacci heap data structure?
"If we cut a node from its parent, we can just decrease the order of that node by one to indicate that it has fewer children than it thought it previously did." - 1. we need to subtract the size of the subtree that we cut, don't we?. 2. how are we going to get the pointer to the root to update its order? we cannot traverse parents, because it can cost O(log(n)).
Jul
18
awarded Nice Answer
Jul
2
awarded Curious
Jul
2
awarded Curious
Jun
21
awarded Yearling
Jun
21
awarded Notable Question
Jun
11
awarded Popular Question
Apr
29
answered Library function to compose a function with itself n times
Apr
25
awarded Supporter
Apr
17
awarded Necromancer
Mar
26
awarded Supporter
Mar
25
awarded Self-Learner
Mar
13
awarded Popular Question
Dec
8
accepted Alter vs Modify vs Change (in Legal Documents)
Dec
8
awarded Scholar
Dec
8
revised Alter vs Modify vs Change (in Legal Documents)
narrowed the scope of the question to legal domain
Dec
8
comment Alter vs Modify vs Change (in Legal Documents)
so they are basically the same.
Dec
8
comment Alter vs Modify vs Change (in Legal Documents)
@BarrieEngland, is there a difference in general meaning of alter and modify? They seem to me interchangeable?
1 2 3 4 5