Dijkstra’s Algorithm

import { YtQuiz} from '../js/yt-quiz.js';

Dijkstra’s Algorithm 1: Introduction

questions1 = [
    {
        time: "4:02",
        question: "How can we check if a path exists from s to every other vertex?",
        answers: [ ],
        correct: "We can use DFS or BFS to check graph connectivity."
    },
    {
        time: "4:49",
        question: "Continue when ready.",
        answers: [ ],
        correct: "Continue when ready."
    },
    {
        time: "6:20",
        question: "Continue when ready.",
        answers: [ ],
        correct: "Continue when ready."
    },
]
yt1 = new YtQuiz("9JDX3KpQUTE", questions1);
yt1.html();

Dijkstra’s Algorithm 2: Pseudocode for Dijkstra’s Algorithm

Dijkstra’s Algorithm 3: Dijkstra’s Algorithm with negative edge weights

questions3 = [
    {
        time: 24,
        question: "What is the shortest path from s to t?",
        answers: [],
        correct: "s->v->t (-4)"
    },
    {
        time: 43,
        question: "What would Dijkstra's find?",
        answers: [],
        correct: "s->t (-2)"
    },
    {
        time: "1:22",
        question: "How could we alter the graph to make it work with Dijkstra's?",
        answers: [],
        correct: "We cannot just add a large to each edge."
    },
]
yt3 = new YtQuiz("CzHloNUaff8", questions3);
yt3.html();

Dijkstra’s Algorithm 4: Proof of correctness part 1

Dijkstra’s Algorithm 5: Proof of correctness part 2

Dijkstra’s Algorithm 6: Running time

questions6 = [
    {
        time: 19,
        question: "Continue when ready.",
        answers: [],
        correct: "Continue when ready."
    },
    {
        time: 40,
        question: "How many times does the outer while-loop iterate?",
        answers: [
            "O(1)",
            "O(n)",
            "O(m)",
            "O(n + m)",
        ],
        correct: 1
    },
    {
        time: "1:25",
        question: "How many times do the inner two for-loops iterate in total?",
        answers: [
            "O(1)",
            "O(n)",
            "O(m)",
            "O(n + m)",
        ],
        correct: 2
    },
]
yt6 = new YtQuiz("u40t-5CYrpk", questions6);
yt6.html();