-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFriendNetwork.cpp
More file actions
92 lines (84 loc) · 1.94 KB
/
FriendNetwork.cpp
File metadata and controls
92 lines (84 loc) · 1.94 KB
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
85
86
87
88
89
90
91
92
#include "FriendNetwork.h"
#include <string>
#include <iostream>
using namespace std;
FriendNetwork::FriendNetwork() {
TABLE_SIZE = 211;
friendGraph = new FriendNode[TABLE_SIZE];
}
int FriendNetwork::insertPerson(string name) {
int key = hash(name);
while (friendGraph[key].name != "") {
key++;
if (key == TABLE_SIZE) {
key = 0;
}
}
friendGraph[key].name = name;
return key;
}
void FriendNetwork::addFriend(int key, string fri) {
if (friendGraph[key].next == NULL) {
friendGraph[key].next = new FriendNode();
friendGraph[key].next -> name = fri;
}
else {
FriendNode *finder = friendGraph[key].next;
while(finder -> next != NULL) {
finder = finder -> next;
}
finder -> next = new FriendNode();
finder -> next -> name = fri;
}
}
int FriendNetwork::findPerson(string name) {
int key = hash(name);
while(friendGraph[key].name != name &&
friendGraph[key].name != "") {
key++;
if (key == TABLE_SIZE) {
key = 0;
}
}
if (friendGraph[key].name != name) {
key = -1;
}
return key;
}
int FriendNetwork::hash(string name) {
int hash = 0;
for (int i = 0; i < name.length(); i++) {
hash = (hash * 101 + name[i]) % TABLE_SIZE;
}
return hash;
}
void FriendNetwork::printNetwork() {
cout << "All available users:" << endl;
for (int i = 0; i < TABLE_SIZE; i++) {
cout << i << ": ";
if (friendGraph[i].name == "") {
cout << "NULL" << endl;
}
else {
cout << friendGraph[i].name;
FriendNode *finder = friendGraph[i].next;
while (finder != NULL) {
cout << ", " << finder -> name;
finder = finder -> next;
}
cout << endl;
}
}
}
string FriendNetwork::retrieveFriends(int key) {
string friends = "";
FriendNode *finder = friendGraph[key].next;
while (finder != NULL) {
friends += finder -> name;
if (finder -> next != NULL) {
friends += ",";
}
finder = finder -> next;
}
return friends;
}