Register

Data Structure Decrease Key Extract Min

913 views
0 0 votes
Why Decrease Key operation we do only on edges and Extract Min operation do only on vertices? (I mean why Decrease key cannot operate on both edges and vertices?)

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · time complexityNext → · awes previous year
← Previous in category · test seriesNext in category → · Testbook Test Series...
Position:
Show:

Related questions

3 3 votes
0 0 answers
2.0k
2.0k views
Hitoshi asked Oct 15, 2017
2,008 views
Self Doubt ( Decrease key operation )
While going through dijkstra's algorithm, there is a term "decrease key". I am not getting the meaning when it says "we do decrease key operation". What exactly we do and...
4 4 votes
1 1 answer
185
185 views
GO Classes asked Jul 22
185 views
GO Classes DPP | GATE CS, DA | Data Structure | Priority Update in Min-Heap
Consider the following min-heap where each node is written as $\texttt{(value, priority)}$:Now perform these operations in order:$\texttt{updatePriority(A, 8)}$ $\texttt{...
6 6 votes
1 1 answer
180
180 views
GO Classes asked Jul 22
180 views
GO Classes DPP | GATE CS, DA | Data Structure | Build Min-Heap
Insert the following values one by one into an initially empty minimum binary heap:$$10, 12, 1, 14, 6, 5, 8, 15, 3, 9$$What is the final heap array in level-order?$[1, 3,...
5 5 votes
2 2 answers
191
191 views
GO Classes asked Jul 21
191 views
GO Classes DPP | GATE CS, DA | Data Structure | DeleteMin from Min-Heap
A min-heap is stored using $1$-based indexing as:$[2, 13, 7, 17, 14, 22, 8, 21]$After one $\texttt{DeleteMin}$ operation, what is the final heap array?$[7, 13, 8, 17, 14,...