-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathChemin.h
64 lines (51 loc) · 1.79 KB
/
Chemin.h
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
/*
* Copyright 2016 <copyright holder> <email>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef CHEMIN_H
#define CHEMIN_H
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <time.h>
#include <algorithm>
class Chemin
{
private:
std::vector<int> path;
public:
Chemin();
Chemin(const std::vector<int>& chemin);
Chemin(int taille);
std::vector<int> getChemin() const { return path; };
int get_extremite_A() const { return path[0]; };
int get_extremite_B() const { return path[path.size()-1]; };
//retourne vrai si la ville se trouve sur le chemin
bool isOnTheWay(int ville);
//operations sur le chemin a parcourir
void swap_step(int step1, int step2);
//echange les places de deux villes dans le chemin
void swap_cities(int ville1, int ville2);
//echange deux villes au hasard dans le chemin
void random_swap_step();
std::ostream& print(std::ostream& out) const;
//returns false if ch1 != ch2
bool diff_path(std::vector< int > ch) const;
friend std::ostream& operator<<(std::ostream& out, const Chemin& c)
{ return c.print(out); }
friend bool operator!=(const Chemin& ch1, const Chemin& ch2)
{ return (ch1.diff_path(ch2.getChemin())); }
};
#endif // CHEMIN_H