-
Notifications
You must be signed in to change notification settings - Fork 1
/
AdjacencyList.cpp
63 lines (60 loc) · 1.43 KB
/
AdjacencyList.cpp
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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
class AdjacencyList
{
private:
int nodes;
vector<int> *adjList;
public:
AdjacencyList(int nodes)
{
this->nodes = nodes;
adjList = new vector<int>[nodes];
}
void display()
{
for (int i = 0; i < nodes; i++)
{
cout << "Node " << i << ": ";
for (auto adjNode : adjList[i])
cout << " -> " << adjNode;
cout << endl;
}
}
void add_edge(int origin, int destination)
{
adjList[origin].push_back(destination);
adjList[destination].push_back(origin);
}
void del_edge(int origin, int destination)
{
for (int i = 0; i < adjList[origin].size(); i++)
{
if (adjList[origin][i] == destination)
{
adjList[origin].erase(adjList[origin].begin() + i);
break;
}
}
for (int i = 0; i < adjList[destination].size(); i++)
{
if (adjList[destination][i] == origin)
{
adjList[destination].erase(adjList[destination].begin() + i);
break;
}
}
}
};
int main()
{
int vertices = 5;
AdjacencyList adjList(vertices);
adjList.add_edge(0, 1);
adjList.add_edge(0, 2);
adjList.add_edge(1, 3);
adjList.add_edge(1, 2);
adjList.del_edge(0, 1);
adjList.display();
}