-
Notifications
You must be signed in to change notification settings - Fork 2
/
Graph.cpp
172 lines (141 loc) · 5.2 KB
/
Graph.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
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
//
// Created by ivanedo on 15-05-16.
//
#include "Graph.h"
#include <algorithm>
#include <memory>
#include <iterator>
#include <iostream>
#include <fstream>
#include <sstream>
#include <cmath>
#include <numeric>
Graph::~Graph() {
std::for_each(customers.begin(), customers.end(), std::default_delete<Customer>());
std::for_each(edges.begin(), edges.end(), std::default_delete<Edge>());
}
void Graph::parse(std::ifstream &fin_instance) {
std::string tmp;
fin_instance >> name;
fin_instance >> tmp; // VEHICLE
fin_instance >> tmp; // NUMBER
fin_instance >> tmp; // CAPACITY
fin_instance >> vehicle_number;
fin_instance >> vehicle_capacity;
fin_instance >> tmp; // CUSTOMER
while(tmp.compare("SERVICE") != 0) {
fin_instance >> tmp;
}
fin_instance >> tmp; // TIME
// reading customers data
for(int id,x,y,demand,ready,due,service; fin_instance >>id>>x>>y>>demand>>ready>>due>>service;) {
Customer *customer = new Customer(id, x, y, demand, ready, due, service, this);
customers.push_back(customer);
}
// creating the edges between customers
create_edges();
}
int Graph::get_vehicle_number() {
return vehicle_number;
}
int Graph::get_vehicle_capacity() {
return vehicle_capacity;
}
std::string Graph::get_name() {
return name;
}
Customer* Graph::get_customer(int id) {
return customers[id];
}
Edge* Graph::get_edge(int start, int end) {
std::vector<Edge*>::iterator it = find_if(edges.begin(), edges.end(), [start, end] (Edge *edge) {
int first = edge->get_components().first;
int second = edge->get_components().second;
return start == first && end == second;
});
return *it;
}
long double Graph::distance_between(Customer* c1, Customer* c2) {
return std::hypot(c1->get_x() - c2->get_x(), c1->get_y() - c2->get_y());
}
void Graph::create_edges() {
for (std::vector<Customer*>::iterator source = customers.begin(); source != customers.end(); ++source) {
for (std::vector<Customer*>::iterator target = customers.begin(); target != customers.end() ; ++target) {
if ((*source)->get_id() != (*target)->get_id() && check_edge(*source, *target)) {
long double cost = distance_between(*source, *target);
edges.push_back(new Edge(std::make_pair((*source)->get_id(), (*target)->get_id()), cost, this));
}
}
}
}
const std::vector<Customer*>& Graph::get_customers() const {
return customers;
}
const std::vector<Edge*>& Graph::get_edges() const {
return edges;
}
std::vector<Edge*> Graph::get_edges(Customer *c1) {
std::vector<Edge*> selection(edges.size());
auto it = std::copy_if (edges.begin(), edges.end(), selection.begin(), [c1] (Edge *i) {
return (i->get_components().first == c1->get_id() || i->get_components().second == c1->get_id());
} );
selection.resize(std::distance(selection.begin(), it));
return selection;
}
std::vector<Edge*> Graph::get_edges(Customer *c1, std::vector<int> customers) {
std::vector<Edge*> selection;
for (std::vector<int>::iterator i = customers.begin(); i != customers.end(); ++i) {
selection.push_back(get_edge(c1->get_id(), get_customer(*i)->get_id()));
}
return selection;
}
std::vector<int> Graph::get_customers_ids() {
std::vector<int> ids(customers.size() - 1);
std::iota(ids.begin(), ids.end(), 1);
return ids;
}
unsigned long Graph::get_customers_number() {
return customers.size() - 1;
}
void Graph::print_customers(std::vector<Customer*> customers_vec) {
std::cout << "::::::::::::::: Customers :::::::::::::::" << std::endl;
for (std::vector<Customer*>::iterator customer = customers_vec.begin(); customer != customers_vec.end(); ++customer) {
std::cout << "::::::::::::::::::::::::::::::::::::::::" << std::endl;
(*customer)->print();
}
}
void Graph::print_edges(std::vector<Edge*> edges_vec) {
std::cout << "::::::::::::::: Edges :::::::::::::::" << std::endl;
for (std::vector<Edge*>::iterator edge = edges_vec.begin(); edge != edges_vec.end(); ++edge) {
(*edge)->print();
}
}
void Graph::print() {
std::cout << "Instance name: " << name << std::endl;
std::cout << "Vehicle number: " << vehicle_number << std::endl;
std::cout << "Vehicle capacity: " << vehicle_capacity << std::endl;
std::cout << "Number of Customers: " << customers.size() - 1 << std::endl;
std::cout << "Number of Edges: " << edges.size() << std::endl;
print_customers(customers);
print_edges(edges);
}
bool Graph::check_edge(Customer *start, Customer *end) {
long double time_distance = distance_between(start, end);
if (start->get_demand() + end->get_demand() <= vehicle_capacity) {
if (start->get_earliest_time() + start->get_service_time() + time_distance <= end->get_latest_time()) {
return true;
}
}
return false;
}
void Graph::set_objectives(std::vector<char> objectives) {
this->objectives = objectives;
}
std::vector<char> Graph::get_objectives() {
return objectives;
}
void Graph::print_objectives() {
for (auto o : objectives) {
std::cout << o << " ";
}
}