- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for outEdges (0.2 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
@Test public void outEdges_checkReturnedSetMutability() { addNode(N1); Set<String> outEdges = network.outEdges(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> outEdges.add(E12)); addEdge(N1, N2, E12); assertThat(network.outEdges(N1)).containsExactlyElementsIn(outEdges); } @Override @Test public void predecessors_checkReturnedSetMutability() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<E> edgesConnecting(N nodeU, N nodeV) { Set<E> outEdgesU = outEdges(nodeU); Set<E> inEdgesV = inEdges(nodeV); return nodePairInvalidatableSet( outEdgesU.size() <= inEdgesV.size() ? unmodifiableSet(Sets.filter(outEdgesU, connectedPredicate(nodeU, nodeV))) : unmodifiableSet(Sets.filter(inEdgesV, connectedPredicate(nodeV, nodeU))),
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<E> edgesConnecting(N nodeU, N nodeV) { Set<E> outEdgesU = outEdges(nodeU); Set<E> inEdgesV = inEdges(nodeV); return nodePairInvalidatableSet( outEdgesU.size() <= inEdgesV.size() ? unmodifiableSet(Sets.filter(outEdgesU, connectedPredicate(nodeU, nodeV))) : unmodifiableSet(Sets.filter(inEdgesV, connectedPredicate(nodeV, nodeU))),
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
public int outDegree(N node) { return delegate().inDegree(node); // transpose } @Override public Set<E> inEdges(N node) { return delegate().outEdges(node); // transpose } @Override public Set<E> outEdges(N node) { return delegate().inEdges(node); // transpose } @Override public EndpointPair<N> incidentNodes(E edge) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
/** * Returns a live view of the edges whose {@link #incidentNodes(Object) incident nodes} in this * network include {@code node}. * * <p>This is equal to the union of {@link #inEdges(Object)} and {@link #outEdges(Object)}. * * <p>If {@code node} is removed from the network after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 22.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
public int outDegree(N node) { return delegate().inDegree(node); // transpose } @Override public Set<E> inEdges(N node) { return delegate().outEdges(node); // transpose } @Override public Set<E> outEdges(N node) { return delegate().inEdges(node); // transpose } @Override public EndpointPair<N> incidentNodes(E edge) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
/** * Returns a live view of the edges whose {@link #incidentNodes(Object) incident nodes} in this * network include {@code node}. * * <p>This is equal to the union of {@link #inEdges(Object)} and {@link #outEdges(Object)}. * * <p>If {@code node} is removed from the network after this method is called, the {@code Set} * {@code view} returned by this method will be invalidated, and will throw {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 21.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
// mark values type markKind uint8 const ( notFound markKind = iota // block has not been discovered yet notExplored // discovered and in queue, outedges not processed yet explored // discovered and in queue, outedges processed done // all done, in output ordering ) type backedgesState struct { b *Block i int }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/report.go
measurement.Percentage(flatSum, rpt.total), rpt.formatValue(cum), measurement.Percentage(cum, rpt.total), name) // Print outgoing edges. outEdges := n.Out.Sort() for _, out := range outEdges { var inline string if out.Inline { inline = " (inline)" } fmt.Fprintf(w, "%50s %s | %s%s\n", rpt.formatValue(out.Weight),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 37.5K bytes - Viewed (0) -
tensorflow/compiler/jit/build_xla_ops_pass.cc
// from an XLA cluster. bool check_output_numerics; }; void MoveOutgoingEdges(Graph* g, Node* old_node, Node* new_node) { std::vector<const Edge*> out_edges(old_node->out_edges().begin(), old_node->out_edges().end()); for (const Edge* edge : out_edges) { // TODO(sanjoy): This does not update NodeDef inputs. To be able to update // NodeDef inputs we first need to fix encapsulate_subgraphs_pass to fix up
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 24.3K bytes - Viewed (0)