Floyd-Warshall Algorithm

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

Floyd-Warshall Algorithm 1: Introduction

questions1 = [
    {
        time: "1:44",
        question: "How many times would I need to call Dijkstra's Algorithm or the Bellman-Ford Algorithm to solve the all-pairs shortest path problem?",
        answers: [
            "1",
            "n-1",
            "n",
            "n^2",
        ],
        correct: 2
    },
]
yt1 = new YtQuiz("e_VsNb0G5Rg", questions1);
yt1.html();

Floyd-Warshall Algorithm 2: Comparing Algorithms

questions2 = [
    {
        time: "0:52",
        question: "Which algorithm would you use for sparse graphs?",
        answers: [
            "Dijkstra's Algorithm",
            "Bellman-Ford Algorithm",
            "Floyd-Warshall Algorithm",
            "It depends",
        ],
        correct: 3
    },
    {
        time: "1:34",
        question: "Which algorithm would you use for dense graphs?",
        answers: [
            "Dijkstra's Algorithm",
            "Bellman-Ford Algorithm",
            "Floyd-Warshall Algorithm",
            "It depends",
        ],
        correct: 2
    },
]
yt2 = new YtQuiz("Ib4_-e46yfg", questions2);
yt2.html();

Floyd-Warshall Algorithm 3: Implementation

questions3 = [
    {
            time: "1:33",
            question: "What is the value of the shortest path found by Floyd-Warshall given the shown parameters.",
            answers: [
                "11",
                "-20",
                "Negative cycle",
                "Cannot be determined",
            ],
            correct: 3
    },
    {
            time: "6:00",
            question: "Which index represents the base case?",
            answers: [
                "i",
                "j",
                "k",
            ],
            correct: 2
    },
    {
            time: "10:11",
            question: "What is the running time?",
            answers: [ ],
            correct: "O(n^3)"
    },
    {
            time: "11:10",
            question: "Where would you find the final path lengths?",
            answers: [ ],
            correct: "At pathLengths[from][to][n]."
    },
    {
            time: "11:48",
            question: "How do we check for negative cycles?",
            answers: [ ],
            correct: "At pathLengths[i][i][n] (look for negative values)."
    },
]
yt3 = new YtQuiz("MrSrajT4q-A", questions3);
yt3.html();