6f: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:[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of "}]]}],["$","$1","1",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

n

"}}]]}]}],["$","$1","2",{"children":[["$","$1","0",{"children":" vertices?"}]]}]]}]] 6d:T53f,

Θ(n^2 \ log \ n)

65:["$","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":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

Θ(n^2)

"}}]]}]}]]}]]]}],["$","li","B",{"children":[["$","span",null,{"className":"font-semibold","children":["B","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"$6d"}}]]}]}]]}]]]}],["$","li","C",{"children":[["$","span",null,{"className":"font-semibold","children":["C","."]}]," ",[["$","p","0",{"children":[["$","$1","0",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

Θ(n^3)

"}}]]}]}]]}]]]}],"$L6e"]}] 66:["$","p",null,{"className":"mt-3 text-sm text-content-secondary","data-ssr-question-analytics":true,"children":["Attempted by ",1054," students","","."]}] 67:["$","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%2Fbellman-ford-algo%2Fpyq-questions%3Fq%3D68ecad0a95474565f43f0214","className":"underline","children":"Sign up free"}]]}] 68:["$","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 ",7," of ",16," ",["$","span",null,{"className":"inline-flex shrink-0 text-xs font-medium text-content-muted","children":"Q3718"}]," in"," ",["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/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":[["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecacfd95474565f43f00e7","className":"text-content-success hover:underline","data-ssr-question-prev":true,"children":"← Previous question"}]}],["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecad4195474565f43f0766","className":"text-content-success hover:underline","data-ssr-question-next":true,"children":"Next question →"}]}],[["$","li","68ecabf395474565f43eeb2c",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecabf395474565f43eeb2c","className":"text-content-success hover:underline","children":["Question ",2]}]}],["$","li","68ecac0295474565f43eec3a",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecac0295474565f43eec3a","className":"text-content-success hover:underline","children":["Question ",3]}]}],["$","li","68ecac4095474565f43ef09b",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecac4095474565f43ef09b","className":"text-content-success hover:underline","children":["Question ",4]}]}],["$","li","68ecac6f95474565f43ef3d5",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ecac6f95474565f43ef3d5","className":"text-content-success hover:underline","children":["Question ",5]}]}],["$","li","68ff6327f026506b12715eb4",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=68ff6327f026506b12715eb4","className":"text-content-success hover:underline","children":["Question ",9]}]}],["$","li","691ecf9c3ac59a7ddd32eb38",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=691ecf9c3ac59a7ddd32eb38","className":"text-content-success hover:underline","children":["Question ",10]}]}],["$","li","691ecfe33ac59a7ddd32f4f1",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=691ecfe33ac59a7ddd32f4f1","className":"text-content-success hover:underline","children":["Question ",11]}]}],["$","li","691ed0523ac59a7ddd3303cc",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/shortest-path-algos/bellman-ford-algo/pyq-questions?q=691ed0523ac59a7ddd3303cc","className":"text-content-success hover:underline","children":["Question ",12]}]}]]]}]]}] 69:["$","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"]}]}] 6b:["$","div",null,{"data-learn-authed-skeleton":true,"className":"min-h-[var(--kg-design-utility-min-h-451bd10b)]","children":["$","$L6f",null,{"variant":"question"}]}]

What is the time complexity of Bellman-Ford single-source shortest path…