CB-Algorithms/Graphs/ArrayOfLLImp.cpp at main · manohar2000/CB-Algorithms · 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
#include <iostream>
#include <list>
using namespace std;


class Graph
{
    int V;
    list<int> *l;

    public:
        Graph(int v)
        {
            V= v;
            l = new list<int> [V];
        }

        void addNode(int a, int b, bool biDirection=true)
        {
            l[a].push_back(b);
            if(biDirection)
            {
                l[b].push_back(a);
            }
        }

        void printAdjList()
        {
            for(int i=0;i<V;i++)
            {
                cout<<i<<"->";
                for(int vertex: l[i])
                {
                    cout<<vertex<<",";
                }
                cout<<endl;
            }
        }
};


int main()
{
    Graph g(5);
    g.addNode(0,1);
    g.addNode(0,4);
    g.addNode(4,3);
    g.addNode(1,4);
    g.addNode(1,2);
    g.addNode(2,3);
    g.addNode(2,3);


    g.printAdjList();
}