Prim’s Algorithm

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

Prim’s Algorithm 1: Introduction

questions1 = [
    {
        time: "5:35",
        question: "Continue when ready.",
        answers: [ ],
        correct: "Continue when ready.",
    },
]
yt1 = new YtQuiz("JrgwuuPtQAg", questions1);
yt1.html();

Prim’s Algorithm 2: Description

questions2 = [
    {
        time: "0:34",
        question: "Continue when ready.",
        answers: [
        ],
        correct: "Continue when ready.",
    },
]
yt2 = new YtQuiz("_OKbx8ma2oI", questions2);
yt2.html();

Prim’s Algorithm 3: Graph Properties

questions3 = [
    {
        time: "1:31",
        question: "How many possible cuts are there for a graph with n vertices?",
        answers: [
            "O(n)",
            "O(n^2)",
            "O(2^n)",
            "O(n^n)",
        ],
        correct: 2
    },
]
yt3 = new YtQuiz("jZCcHqEMzF8", questions3);
yt3.html();

Prim’s Algorithm 4: Finding Spanning Trees

Prim’s Algorithm 5: Prim’s Finds The MST

Prim’s Algorithm 6: The Cut Property

questions6 = [
    {
        time: "02:06",
        question: "s the new set of edges a spanning tree?",
        answers: [
            "Yes",
            "No",
            "Only if e is the cheapest edge",
            "Maybe",
        ],
        correct: 3
    },
]
yt6 = new YtQuiz("TzfOL4TxjOU", questions6);
yt6.html();