Live/DataStructures.cpp at master · tomnof/Live · 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
85
86
87
88
89
90
91
92
93
94
95
/*
 * DataStructures.cpp
 *
 *  Created on: Oct 17, 2016
 *      Author: tmp
 */

#include "DataStructures.h"

namespace tdenum {

IncreasingWeightNodeQueue::IncreasingWeightNodeQueue(int numberOfNodes) :
		weight(numberOfNodes, 0) {
	vector< pair<int,Node> > temporaryQueue;
	for (Node v = 0; v<numberOfNodes; v++) {
		temporaryQueue.push_back(pair<int,Node> (0,v));
	}
	queue = set< pair<int,Node> >(temporaryQueue.begin(), temporaryQueue.end());
}

void IncreasingWeightNodeQueue::increaseWeight(Node v) {
	queue.erase(pair<int,Node> (weight[v],v));
	weight[v]++;
	queue.insert(pair<int,Node> (weight[v],v));
}

int IncreasingWeightNodeQueue::getWeight(Node v) {
	return weight[v];
}

bool IncreasingWeightNodeQueue::isEmpty() {
	return queue.empty();
}

Node IncreasingWeightNodeQueue::pop() {
	pair<int,Node> current = *queue.rbegin();
	Node v = current.second;
	queue.erase(current);
	return v;
}


bool WeightedNodeSetQueue::isEmpty() {
	return queue.empty();
}

bool WeightedNodeSetQueue::isMember(const vector<Node>& nodeSet, int weight) {
	return queue.find(make_pair(weight, nodeSet)) != queue.end();
}

void WeightedNodeSetQueue::insert(const vector<Node>& nodeSet, int weight) {
	queue.insert(make_pair(weight, nodeSet));
}

vector<Node> WeightedNodeSetQueue::pop() {
	vector<Node> nodeSet = queue.begin()->second;
	queue.erase(queue.begin());
	return nodeSet;
}


bool NodeSetSet::isMember(const vector<Node>& nodeSet) {
	return sets.find(nodeSet) != sets.end();
}

void NodeSetSet::insert(const vector<Node>& nodeSet) {
	sets.insert(nodeSet);
}


NodeSetProducer::NodeSetProducer(int sizeOfOriginalNodeSet) :
		isMember(sizeOfOriginalNodeSet, false){}

void NodeSetProducer::insert(Node v) {
	isMember[v] = true;
}

void NodeSetProducer::remove(Node v) {
	isMember[v] = false;
}

NodeSet NodeSetProducer::produce() {
	NodeSet members;
	for (unsigned int i=0; i<isMember.size(); i++) {
		if (isMember[i]) {
			members.push_back(i);
		}
	}
	return members;
}

} /* namespace tdenum */