31 lines
484 B
Java
31 lines
484 B
Java
|
package com.google.common.graph;
|
||
|
|
|
||
|
|
import java.util.Set;
|
||
|
|
|
||
|
|
/* loaded from: classes2.dex */
|
||
|
|
interface NetworkConnections<N, E> {
|
||
|
|
void addInEdge(E e, N n, boolean z);
|
||
|
|
|
||
|
|
void addOutEdge(E e, N n);
|
||
|
|
|
||
|
|
N adjacentNode(E e);
|
||
|
|
|
||
|
|
Set<N> adjacentNodes();
|
||
|
|
|
||
|
|
Set<E> edgesConnecting(N n);
|
||
|
|
|
||
|
|
Set<E> inEdges();
|
||
|
|
|
||
|
|
Set<E> incidentEdges();
|
||
|
|
|
||
|
|
Set<E> outEdges();
|
||
|
|
|
||
|
|
Set<N> predecessors();
|
||
|
|
|
||
|
|
N removeInEdge(E e, boolean z);
|
||
|
|
|
||
|
|
N removeOutEdge(E e);
|
||
|
|
|
||
|
|
Set<N> successors();
|
||
|
|
}
|