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?) Data Structures dijkstras-algorithm + – srestha 923 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Soumya Tiwari commented Oct 30, 2018 reply Follow flag You are talking about operation related to Heap right?? What I am not getting is what edges represent...?? Do you mean to say why we don't run Min-Heapify when we do decrease key..? 0 0 replyShare Shaik Masthan commented Oct 30, 2018 reply Follow flag Why Decrease Key operation we do only on edges i didn't get this line... can you elaborate it or just provide the link where you got this statement. 0 0 replyShare srestha commented Oct 30, 2018 reply Follow flag u can refer this answer https://gateoverflow.in/1374/gate2005-38 0 0 replyShare Shaik Masthan commented Oct 30, 2018 reply Follow flag those are concepts... you can apply on any Data structures Decrease Key means ===> value we decrease but it not necessarily lead to Minimum value. Extract Min means ===> we have to delete the Minimum value. ( The value may refers to Nodes or edges ) 0 0 replyShare Please log in or register to add a comment.
