Home
last modified time | relevance | path

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

12

/external/guava/guava/src/com/google/common/graph/
DEndpointPair.java45 private final N nodeV; field in EndpointPair
47 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
58 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
64 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
69 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
99 public final N nodeV() { in nodeV() method in EndpointPair
196 private Unordered(N nodeU, N nodeV) { in Unordered()
DForwardingNetwork.java126 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
136 public Optional<E> edgeConnecting(N nodeU, N nodeV) { in edgeConnecting()
147 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
158 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DNetwork.java294 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
325 Optional<E> edgeConnecting(N nodeU, N nodeV); in edgeConnecting()
355 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
381 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DForwardingValueGraph.java100 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
110 public Optional<V> edgeValue(N nodeU, N nodeV) { in edgeValue()
121 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
DMutableGraph.java59 boolean putEdge(N nodeU, N nodeV); in putEdge()
96 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
DValueGraph.java262 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
289 Optional<V> edgeValue(N nodeU, N nodeV); in edgeValue()
314 V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue); in edgeValueOrDefault()
DMutableValueGraph.java65 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
108 V removeEdge(N nodeU, N nodeV); in removeEdge()
DStandardMutableGraph.java51 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
67 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
DStandardNetwork.java140 N nodeV = requireNonNull(nodeConnections.get(nodeU)).adjacentNode(edge); in incidentNodes() local
150 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
155 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); in edgesConnecting() local
DStandardMutableValueGraph.java89 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
166 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DStandardMutableNetwork.java79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
159 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local
DMutableNetwork.java68 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
/external/guava/android/guava/src/com/google/common/graph/
DEndpointPair.java45 private final N nodeV; field in EndpointPair
47 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
58 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
64 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
69 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
99 public final N nodeV() { in nodeV() method in EndpointPair
196 private Unordered(N nodeU, N nodeV) { in Unordered()
DMutableGraph.java59 boolean putEdge(N nodeU, N nodeV); in putEdge()
96 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
DMutableValueGraph.java65 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
108 V removeEdge(N nodeU, N nodeV); in removeEdge()
DForwardingNetwork.java125 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
136 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
147 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
DStandardMutableGraph.java51 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
67 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
DNetwork.java293 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
325 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
351 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
DStandardNetwork.java140 N nodeV = requireNonNull(nodeConnections.get(nodeU)).adjacentNode(edge); in incidentNodes() local
150 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
155 checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); in edgesConnecting() local
DStandardMutableValueGraph.java89 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
166 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
DForwardingValueGraph.java99 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
110 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
DStandardMutableNetwork.java79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
159 N nodeV = connectionsU.adjacentNode(edge); in removeEdge() local
DValueGraph.java261 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
290 V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue); in edgeValueOrDefault()
DMutableNetwork.java68 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
DIncidentEdgeSet.java75 Object nodeV = endpointPair.nodeV(); in contains() local

12