26 lines
442 B
Java
26 lines
442 B
Java
|
package com.google.common.graph;
|
||
|
|
|
||
|
|
import java.util.Iterator;
|
||
|
|
import java.util.Set;
|
||
|
|
|
||
|
|
/* loaded from: classes2.dex */
|
||
|
|
interface GraphConnections<N, V> {
|
||
|
|
void addPredecessor(N n, V v);
|
||
|
|
|
||
|
|
V addSuccessor(N n, V v);
|
||
|
|
|
||
|
|
Set<N> adjacentNodes();
|
||
|
|
|
||
|
|
Iterator<EndpointPair<N>> incidentEdgeIterator(N n);
|
||
|
|
|
||
|
|
Set<N> predecessors();
|
||
|
|
|
||
|
|
void removePredecessor(N n);
|
||
|
|
|
||
|
|
V removeSuccessor(N n);
|
||
|
|
|
||
|
|
Set<N> successors();
|
||
|
|
|
||
|
|
V value(N n);
|
||
|
|
}
|