Home
last modified time | relevance | path

Searched defs:nodeV (Results 1 – 25 of 39) 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()
DConfigurableValueGraph.java118 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
130 public @Nullable V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue) { in edgeValueOrDefault()
158 protected final boolean hasEdgeConnecting_internal(N nodeU, N nodeV) { in hasEdgeConnecting_internal()
163 protected final V edgeValueOrDefault_internal(N nodeU, N nodeV, V defaultValue) { in edgeValueOrDefault_internal()
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.java286 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
316 Optional<E> edgeConnecting(N nodeU, N nodeV); in edgeConnecting()
346 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
372 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DMutableGraph.java58 boolean putEdge(N nodeU, N nodeV); in putEdge()
95 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
DForwardingValueGraph.java94 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
104 public Optional<V> edgeValue(N nodeU, N nodeV) { in edgeValue()
114 public @Nullable 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()
DValueGraph.java246 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
273 Optional<V> edgeValue(N nodeU, N nodeV); in edgeValue()
298 V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue); in edgeValueOrDefault()
DConfigurableMutableGraph.java50 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
66 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
DGraphs.java304 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
349 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
359 public Optional<V> edgeValue(N nodeU, N nodeV) { in edgeValue()
369 public @Nullable V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue) { in edgeValueOrDefault()
428 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
438 public Optional<E> edgeConnecting(N nodeU, N nodeV) { in edgeConnecting()
448 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
458 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DConfigurableNetwork.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
DConfigurableMutableValueGraph.java76 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
143 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DConfigurableMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
156 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local
/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()
DConfigurableValueGraph.java118 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
131 public V edgeValueOrDefault(N nodeU, N nodeV, @NullableDecl V defaultValue) { in edgeValueOrDefault()
160 protected final boolean hasEdgeConnecting_internal(N nodeU, N nodeV) { in hasEdgeConnecting_internal()
165 protected final V edgeValueOrDefault_internal(N nodeU, N nodeV, V defaultValue) { in edgeValueOrDefault_internal()
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()
DConfigurableMutableGraph.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.java285 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
316 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
342 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DConfigurableNetwork.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
DConfigurableMutableValueGraph.java76 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
143 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DForwardingValueGraph.java93 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
104 public V edgeValueOrDefault(N nodeU, N nodeV, @NullableDecl V defaultValue) { in edgeValueOrDefault()
DGraphs.java306 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
351 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
362 public V edgeValueOrDefault(N nodeU, N nodeV, @NullableDecl V defaultValue) { in edgeValueOrDefault()
422 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
432 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
442 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DConfigurableMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
156 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local

12