Graph and Connectivity

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

Breadth First Search 1: Introduction

Breadth First Search 2: Order and running time

questions2 = [
    {
        time: "4:07",
        question: "What is the running time of the outer loop?",
        answers: [
            "O(1)",
            "O(lg n)",
            "O(n)",
            "O(n + m)",
            "O(n^2)",
        ],
        correct: 2
    },
    {
        time: "4:44",
        question: "What is the running time of the inner loop?",
        answers: [],
        correct: "It's tough to give the inner loop an exact running time since it changes every iteration depending on vFound."
    },
    {
        time: "5:14",
        question: "How many times does the for-loop consider each edge in the graph?",
        answers: [
            "Once",
            "Twice",
            "Up to n times",
            "Up to m times",
        ],
        correct: 1
    },
]
yt2 = new YtQuiz("TeHkLF5XU6o", questions2);
yt2.html();

Breadth First Search 3: Shortest path and proof

questions3 = [
    {
        time: "2:03",
        question: "Continue when ready",
        answers: [],
        correct: "Continue when ready."
    },
]
yt3 = new YtQuiz("O5E5sIxC-8I", questions3);
yt3.html();

Breadth First Search 4: Connected components

questions4 = [
    {
        time: "1:07",
        question: "Continue when ready",
        answers: [],
        correct: "Continue when ready."
    },
]
yt4 = new YtQuiz("QlvQSl5Soas", questions4);
yt4.html();