The Gateway to Computer Science Excellence
0 votes
41 views

IN CASE OF PRIORITY QUEUE OR WE CAN SAY MAX HEAP OR MIN HEAP.

.WHEN DUPLICATE ENTRIES EXIST THEN WHICH ELEMENT OUT OF TWO SAME ONE WILL GET FIRST CHANCE…

. SOME TIME IT NOT METTER MUCH BUT LET SAY YOU’R PERFORMING DIJKSTRA ALGORITHM THEN BECOME CONFUSING SOME TIME???/ ANYONE HAVE AN IDEA???

in Algorithms by (217 points) | 41 views

Please log in or register to answer this question.

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
50,737 questions
57,258 answers
198,086 comments
104,735 users