The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
73 views

what is Potential function in Fibonacci heap (i dont remember the question ) plz explain with example 

asked in Algorithms by Active (1.9k points) | 73 views

1 Answer

+1 vote
Best answer

$trees(H)$ = number of trees in root list heap $H$

$marks(H)$ = number of marked nodes in heap $H$

                               $\phi (H) = trees(H) + 2*marks(H)$

$\phi (H)$ = Potential of H

tress(H) = 5

marks(H) = 3

$\phi (H) = 5 + 2*3$

               =  $11$

answered by Boss (10k points)
selected by
0
I didn't understand what is trees(h) and marks(h). Please explain it in a simple way
0

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

47,001 questions
51,321 answers
177,477 comments
66,665 users