DisjointPathPair.java
3.28 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
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
/*
* Copyright 2015 Open Networking Laboratory
*
* 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.
*/
package org.onlab.graph;
import java.util.List;
import java.util.Objects;
import java.util.Set;
import static com.google.common.collect.ImmutableSet.of;
import static com.google.common.base.MoreObjects.toStringHelper;
public class DisjointPathPair<V extends Vertex, E extends Edge<V>> implements Path<V, E> {
public Path<V, E> path1, path2;
boolean usingPath1 = true;
/**
* Creates a Disjoint Path Pair from two paths.
*
* @param p1 first path
* @param p2 second path
*/
public DisjointPathPair(Path<V, E> p1, Path<V, E> p2) {
path1 = p1;
path2 = p2;
}
@Override
public V src() {
return path1.src();
}
@Override
public V dst() {
return path1.dst();
}
@Override
public double cost() {
if (!hasBackup()) {
return path1.cost();
}
return path1.cost() + path2.cost();
}
@Override
public List<E> edges() {
if (usingPath1 || !hasBackup()) {
return path1.edges();
} else {
return path2.edges();
}
}
/**
* Checks if this path pair contains a backup/secondary path.
*
* @return boolean representing whether it has backup
*/
public boolean hasBackup() {
return path2 != null && path2.edges() != null;
}
@Override
public String toString() {
return toStringHelper(this)
.add("src", src())
.add("dst", dst())
.add("cost", cost())
.add("edges", edges())
.toString();
}
@Override
public int hashCode() {
Set<Path<V, E>> paths;
if (!hasBackup()) {
paths = of(path1);
} else {
paths = of(path1, path2);
}
return Objects.hash(paths);
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof DisjointPathPair) {
final DisjointPathPair other = (DisjointPathPair) obj;
return Objects.equals(this.src(), other.src()) &&
Objects.equals(this.dst(), other.dst()) &&
(Objects.equals(this.path1, other.path1) &&
Objects.equals(this.path2, other.path2)) ||
(Objects.equals(this.path1, other.path2) &&
Objects.equals(this.path2, other.path1));
}
return false;
}
/**
* Returns number of paths inside this path pair object.
*
* @return number of paths
*/
public int size() {
if (hasBackup()) {
return 2;
}
return 1;
}
}