6e:I[38030,["70161","$1e","88847","$1f","88834","$20","14399","$21","84313","$22","19254","$19","17558","$23","83253","$24","58059","$25","3196","$26","52567","$1a","80321","$27","80363","$28"],"default"] 64:null 65:["$","div",null,{"className":"mt-4","data-ssr-question-stem":true,"children":[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to "}]]}],["$","$1","1",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

v

"}}]]}]}],["$","$1","2",{"children":[["$","$1","0",{"children":" is discovered."}]]}]]}],["$","p","1",{"children":[["$","img","0",{"src":"https://cdn.knowledgegate.ai/question-images/q3804-img-1-migrated-1761565954827.png","alt":"","loading":"lazy"}]]}]]}] 66:["$","ol",null,{"className":"mt-4 list-none space-y-2 pl-0","data-ssr-question-options":true,"children":[["$","li","A",{"children":[["$","span",null,{"className":"font-semibold","children":["A","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"SDT"}]]}]]}]]]}],["$","li","B",{"children":[["$","span",null,{"className":"font-semibold","children":["B","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"SBDT"}]]}]]}]]]}],["$","li","C",{"children":[["$","span",null,{"className":"font-semibold","children":["C","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"SACDT"}]]}]]}]]]}],["$","li","D",{"children":[["$","span",null,{"className":"font-semibold","children":["D","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"SACET"}]]}]]}]]]}]]}] 67:["$","p",null,{"className":"mt-3 text-sm text-content-secondary","data-ssr-question-analytics":true,"children":["Attempted by ",250," students","","."]}] 68:["$","div",null,{"id":"locked-question-solution","className":"kg-paywalled-solution","data-ssr-solution-paywall":true,"children":[["$","p",null,{"children":"Sign up free to check your answer"}],["$","a",null,{"href":"/auth/login?redirect=%2Flearn%2FALGORITHMS%2Falgorithim%2Fshortest-path-algos%2Fdijkstras-algorithm%2Fpyq-questions%3Fq%3D68ecad1f95474565f43f0418","className":"underline","children":"Sign up free"}]]}] 69:["$","nav",null,{"aria-label":"More questions in this collection","className":"mt-8","data-ssr-question-nav":true,"children":[["$","p",null,{"className":"text-sm text-content-secondary","children":["Question ",1," of ",6," ",["$","span",null,{"className":"inline-flex shrink-0 text-xs font-medium text-content-muted","children":"Q3804"}]," in"," ",["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions","className":"text-content-success hover:underline","children":"PYQ Questions"}],"."]}],["$","ul",null,{"className":"mt-2 flex list-none flex-wrap gap-x-4 gap-y-2 pl-0 text-sm","children":[null,["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions?q=691ecfc53ac59a7ddd32f015","className":"text-content-success hover:underline","data-ssr-question-next":true,"children":"Next question →"}]}],[["$","li","691ecfe33ac59a7ddd32f4e8",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions?q=691ecfe33ac59a7ddd32f4e8","className":"text-content-success hover:underline","children":["Question ",3]}]}],["$","li","691ed0223ac59a7ddd32fd86",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions?q=691ed0223ac59a7ddd32fd86","className":"text-content-success hover:underline","children":["Question ",4]}]}],["$","li","691ed07a3ac59a7ddd330a56",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions?q=691ed07a3ac59a7ddd330a56","className":"text-content-success hover:underline","children":["Question ",5]}]}],["$","li","6a1e797e0ea16dab2d3ef079",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/dijkstras-algorithm/pyq-questions?q=6a1e797e0ea16dab2d3ef079","className":"text-content-success hover:underline","children":["Question ",6]}]}]]]}]]}] 6a:["$","p",null,{"className":"mt-8","children":["$","$L63",null,{"href":"/courses/ALGORITHMS","className":"inline-block rounded-lg bg-surface-success-strong px-5 py-2.5 font-semibold text-content-inverse","data-ssr-enroll-cta":true,"children":["Explore the full course:"," ","Algorithms"]}]}] 6c:["$","div",null,{"data-learn-authed-skeleton":true,"className":"min-h-[var(--kg-design-utility-min-h-451bd10b)]","children":["$","$L6e",null,{"variant":"question"}]}]

Consider the directed graph shown in the figure below. There are multiple…