AoaAssignment1/graph_simulator.cpp at main · PulkitGarg777/AoaAssignment1 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include "graph_operations.cpp"
#include <cmath>


Graph generateCycle(int n) {
    Graph g;
    for (int i = 0; i < n; i++) {
        g.addVertex(i);
    }
    for (int i = 0; i < n; i++) {
        int next = (i + 1) % n;
        g.addEdge(i, next);
    }
    return g;
}

Graph generateCompleteGraph(int n) {
    Graph g;
    for (int i = 0; i < n; i++) {
        g.addVertex(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            g.addEdge(i, j);
        }
    }
    return g;
}

Graph generateEmptyGraph(int n) {
    Graph g;

    for (int i = 0; i < n; i++) {
        g.addVertex(i);
    }

    return g;
}

Graph generateHeap(int n) {
    Graph g;
    for (int i = 0; i < n; i++) {
        g.addVertex(i);
    }
    for (int v = 0; v < n; v++) {
        if (v > 0) {
            int parent = (v - 1) / 2;
            g.addEdge(v, parent);
        }
    }
    return g;
}

Graph generateTruncatedHeap(int m, int n) {
    Graph g;
    for (int i = m; i < n; i++) {
        g.addVertex(i);
    }
    for (int v = m; v < n; v++) {
        // Connect to parent if it exists in range
        if (v > 0) {
            int parent = (v - 1) / 2;
            if (parent >= m && parent < n) {
                g.addEdge(v, parent);
            }
        }
    }
    return g;
}

Graph generateEquivalenceModK(int n, int k) {
    Graph g;
    for (int i = 0; i < n; i++) {
        g.addVertex(i);
    }
    for (int u = 0; u < n; u++) {
        for (int v = u + 1; v < n; v++) {
            if ((u - v) % k == 0) {
                g.addEdge(u, v);
            }
        }
    }
    return g;
}