blob: 9236464be16b5917d8481eddb1ad8b116ad250f5 (
plain)
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
|
package bjc.utils.graph;
/**
* An edge in a weighted graph.
*
* @author ben
*
* @param <T>
* The type of the nodes in the graph.
*/
public class Edge<T> {
/* The distance from initial to terminal node. */
private final int distance;
/* The initial and terminal nodes of this edge. */
private final T source, target;
/**
* Create a new edge with set parameters.
*
* @param initial
* The initial node of the edge.
*
* @param terminal
* The terminal node of the edge.
*
* @param distance
* The distance between initial and terminal edge.
*/
public Edge(final T initial, final T terminal, final int distance) {
if (initial == null) {
throw new NullPointerException("Initial node must not be null");
} else if (terminal == null) {
throw new NullPointerException("Terminal node must not be null");
}
this.source = initial;
this.target = terminal;
this.distance = distance;
}
@Override
public boolean equals(final Object obj) {
if (this == obj)
return true;
else if (obj == null)
return false;
else if (getClass() != obj.getClass())
return false;
else {
final Edge<?> other = (Edge<?>) obj;
if (distance != other.distance)
return false;
else if (source == null) {
if (other.source != null) return false;
} else if (!source.equals(other.source))
return false;
else if (target == null) {
if (other.target != null) return false;
} else if (!target.equals(other.target)) return false;
return true;
}
}
/**
* Get the distance in this edge.
*
* @return
* The distance between the initial and terminal nodes of this
* edge.
*/
public int getDistance() {
return distance;
}
/**
* Get the initial node of an edge.
*
* @return
* The initial node of this edge.
*/
public T getSource() {
return source;
}
/**
* Get the target node of an edge.
*
* @return
* The target node of this edge.
*/
public T getTarget() {
return target;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + distance;
result = prime * result + (source == null ? 0 : source.hashCode());
result = prime * result + (target == null ? 0 : target.hashCode());
return result;
}
@Override
public String toString() {
String msg = String.format("source vertex %s to target vertex %s with distance: %s",
source, target, distance);
return msg;
}
}
|
