31 lines
787 B
Java
31 lines
787 B
Java
package DirectedGraphJava;
|
|
|
|
public class Pair<T1,T2> {
|
|
public T1 first;
|
|
public T2 second;
|
|
|
|
public Pair(T1 first, T2 second) {
|
|
this.first = first;
|
|
this.second = second;
|
|
}
|
|
|
|
@Override
|
|
public boolean equals(Object o) {
|
|
if (this == o) return true;
|
|
if (o == null || getClass() != o.getClass()) return false;
|
|
|
|
Pair<?, ?> pair = (Pair<?, ?>) o;
|
|
|
|
if (first != null ? !first.equals(pair.first) : pair.first != null) return false;
|
|
return second != null ? second.equals(pair.second) : pair.second == null;
|
|
}
|
|
|
|
@Override
|
|
public int hashCode() {
|
|
int result = first != null ? first.hashCode() : 0;
|
|
result = 31 * result + (second != null ? second.hashCode() : 0);
|
|
return result;
|
|
}
|
|
|
|
}
|