Home
last modified time | relevance | path

Searched defs:nodeV (Results 1 – 25 of 41) sorted by relevance

12

/external/guava/guava/src/com/google/common/graph/
DEndpointPair.java44 private final N nodeV; field in EndpointPair
46 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
57 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
63 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
68 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
98 public final N nodeV() { in nodeV() method in EndpointPair
194 private Unordered(N nodeU, N nodeV) { in Unordered()
DForwardingNetwork.java124 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
134 public Optional<E> edgeConnecting(N nodeU, N nodeV) { in edgeConnecting()
144 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
154 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DNetwork.java292 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
322 Optional<E> edgeConnecting(N nodeU, N nodeV); in edgeConnecting()
352 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
378 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DForwardingValueGraph.java99 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
109 public Optional<V> edgeValue(N nodeU, N nodeV) { in edgeValue()
119 public @Nullable V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue) { in edgeValueOrDefault()
DMutableGraph.java58 boolean putEdge(N nodeU, N nodeV); in putEdge()
95 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
DValueGraph.java261 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
288 Optional<V> edgeValue(N nodeU, N nodeV); in edgeValue()
313 V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue); in edgeValueOrDefault()
DMutableValueGraph.java62 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
103 V removeEdge(N nodeU, N nodeV); in removeEdge()
DStandardMutableGraph.java50 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
66 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
DStandardNetwork.java138 N nodeV = nodeConnections.get(nodeU).adjacentNode(edge); in incidentNodes() local
148 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
153 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); in edgesConnecting() local
DStandardMutableValueGraph.java84 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
151 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DStandardMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
156 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local
DMutableNetwork.java67 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
/external/guava/android/guava/src/com/google/common/graph/
DEndpointPair.java44 private final N nodeV; field in EndpointPair
46 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
57 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
63 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
68 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
98 public final N nodeV() { in nodeV() method in EndpointPair
194 private Unordered(N nodeU, N nodeV) { in Unordered()
DMutableGraph.java58 boolean putEdge(N nodeU, N nodeV); in putEdge()
95 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
DMutableValueGraph.java62 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
103 V removeEdge(N nodeU, N nodeV); in removeEdge()
DStandardMutableGraph.java50 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
66 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
DForwardingNetwork.java123 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
133 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
143 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DNetwork.java291 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
322 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
348 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DStandardNetwork.java138 N nodeV = nodeConnections.get(nodeU).adjacentNode(edge); in incidentNodes() local
148 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
153 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); in edgesConnecting() local
DForwardingValueGraph.java98 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
109 public V edgeValueOrDefault(N nodeU, N nodeV, @NullableDecl V defaultValue) { in edgeValueOrDefault()
DStandardMutableValueGraph.java84 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
151 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DStandardMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
156 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local
DValueGraph.java260 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
289 V edgeValueOrDefault(N nodeU, N nodeV, @NullableDecl V defaultValue); in edgeValueOrDefault()
DMutableNetwork.java67 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
DIncidentEdgeSet.java74 Object nodeV = endpointPair.nodeV(); in contains() local

12