-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph.cpp
74 lines (61 loc) · 1.39 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
/*
* Graph.cpp
*
* Created on: Feb 26, 2014
* Author: VQMTEAM.
*/
#include "Graph.h"
namespace Machine {
void Graph::Copy(Graph in) {
swap(in);
}
std::string Graph::GetStatus() {
string s = "";
s += "Points: ";
for (unsigned int i = 0; i < size(); ++i)
s += at(i).ToString() + " ";
return s;
}
bool Graph::multiplication_is_safe(unsigned long a, unsigned long b) {
size_t a_bits=highestOneBitPosition(a), b_bits=highestOneBitPosition(b);
return (a_bits+b_bits<=sizeof(unsigned long));
}
size_t Graph::highestOneBitPosition(unsigned long a) {
size_t bits=0;
while (a!=0) {
++bits;
a>>=1;
};
return bits;
}
unsigned long Graph::NumberOfPossiblePaths()
{
unsigned long answer = 1;
for (unsigned long i = 1; i <= size(); ++i)
{
if (multiplication_is_safe(answer,i))
answer *= i;
else
break;
}
return answer;
}
unsigned long Graph::ShortestPathLength()
{
return 1.0 * (size() - 1);
}
unsigned long Graph::Length()
{
return size();
}
double Graph::Measure()
{
double answer = 0.0;
for (unsigned int i = 0; i < size() - 1; ++i)
{
double d = at(i).RelativeMeasure(at(i+1));
answer += d;
}
return answer;
} // MeasureOfQuality()
} /* namespace Machine */