mirror of
https://github.com/VibedByKaKi/alexandroid.git
synced 2026-11-14 09:57:16 +01:00
76 lines
2.6 KiB
Java
76 lines
2.6 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 interface ValueGraph<N, V> extends BaseGraph<N> {
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
|
|
Set<N> adjacentNodes(N n);
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
|
|
boolean allowsSelfLoops();
|
|
|
|
Graph<N> asGraph();
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
int degree(N n);
|
|
|
|
V edgeValueOrDefault(EndpointPair<N> endpointPair, V v);
|
|
|
|
V edgeValueOrDefault(N n, N n2, V v);
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
Set<EndpointPair<N>> edges();
|
|
|
|
boolean equals(Object obj);
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
boolean hasEdgeConnecting(EndpointPair<N> endpointPair);
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
boolean hasEdgeConnecting(N n, N n2);
|
|
|
|
int hashCode();
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
int inDegree(N n);
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
ElementOrder<N> incidentEdgeOrder();
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
Set<EndpointPair<N>> incidentEdges(N n);
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
|
|
boolean isDirected();
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
|
|
ElementOrder<N> nodeOrder();
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
|
|
Set<N> nodes();
|
|
|
|
@Override // com.google.common.graph.BaseGraph
|
|
int outDegree(N n);
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.PredecessorsFunction, com.google.common.graph.Graph
|
|
/* bridge */ /* synthetic */ default Iterable predecessors(Object obj) {
|
|
return predecessors((ValueGraph<N, V>) obj);
|
|
}
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.PredecessorsFunction, com.google.common.graph.Graph
|
|
Set<N> predecessors(N n);
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.SuccessorsFunction, com.google.common.graph.Graph
|
|
/* bridge */ /* synthetic */ default Iterable successors(Object obj) {
|
|
return successors((ValueGraph<N, V>) obj);
|
|
}
|
|
|
|
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.SuccessorsFunction, com.google.common.graph.Graph
|
|
Set<N> successors(N n);
|
|
}
|