mirror of
https://github.com/VibedByKaKi/alexandroid.git
synced 2026-11-14 09:57:16 +01:00
75 lines
3 KiB
Java
75 lines
3 KiB
Java
package com.google.common.graph;
|
|
|
|
import com.google.common.annotations.Beta;
|
|
import java.util.Set;
|
|
|
|
/* compiled from: r8-map-id-b9432e0f623b4a4bff4ba50a8a24c4aafad2c1e11092747b9fb5e6a22af5a940 */
|
|
@Beta
|
|
/* loaded from: classes8.dex */
|
|
public abstract class AbstractGraph<N> extends AbstractBaseGraph<N> implements Graph<N> {
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ int degree(Object obj) {
|
|
return super.degree(obj);
|
|
}
|
|
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ Set edges() {
|
|
return super.edges();
|
|
}
|
|
|
|
@Override // com.google.common.graph.Graph
|
|
public final boolean equals(Object obj) {
|
|
if (obj == this) {
|
|
return true;
|
|
}
|
|
if (!(obj instanceof Graph)) {
|
|
return false;
|
|
}
|
|
Graph graph = (Graph) obj;
|
|
return isDirected() == graph.isDirected() && nodes().equals(graph.nodes()) && edges().equals(graph.edges());
|
|
}
|
|
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ boolean hasEdgeConnecting(EndpointPair endpointPair) {
|
|
return super.hasEdgeConnecting(endpointPair);
|
|
}
|
|
|
|
@Override // com.google.common.graph.Graph
|
|
public final int hashCode() {
|
|
return edges().hashCode();
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ int inDegree(Object obj) {
|
|
return super.inDegree(obj);
|
|
}
|
|
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ ElementOrder incidentEdgeOrder() {
|
|
return super.incidentEdgeOrder();
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ Set incidentEdges(Object obj) {
|
|
return super.incidentEdges(obj);
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ int outDegree(Object obj) {
|
|
return super.outDegree(obj);
|
|
}
|
|
|
|
public String toString() {
|
|
return "isDirected: " + isDirected() + ", allowsSelfLoops: " + allowsSelfLoops() + ", nodes: " + nodes() + ", edges: " + edges();
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
|
|
public /* bridge */ /* synthetic */ boolean hasEdgeConnecting(Object obj, Object obj2) {
|
|
return super.hasEdgeConnecting(obj, obj2);
|
|
}
|
|
}
|