In the lecture, we were told to create a function named updatePriority() to keep track of changes in the heap, but is there any similar inbuilt function or do I need to implement my own heap class and create a function for the same?
Do i need to implement my own heap everytime I use djikstra or prim?
no see this to understand:
Sorry to bother you, but am getting the sample test case right, but still getting wrong answer while submitting. Could you help figure out the problem here? Thank You