- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 234 for Network (0.27 sec)
-
android/guava/src/com/google/common/graph/Network.java
* subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on * the network), you should use the non-mutating {@link Network} interface, or an {@link * ImmutableNetwork}. * * <p>You can create an immutable copy of an existing {@code Network} using {@link * ImmutableNetwork#copyOf(Network)}:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
cni/pkg/install/cniconfig.go
return cniConfig, nil } if len(template.cniNetworkConfig) > 0 { installLog.Infof("Using CNI config template from CNI_NETWORK_CONFIG environment variable.") return []byte(template.cniNetworkConfig), nil } return nil, fmt.Errorf("need CNI_NETWORK_CONFIG or CNI_NETWORK_CONFIG_FILE to be set") } func replaceCNIConfigVars(cniConfig []byte, vars cniConfigVars) []byte { cniConfigStr := string(cniConfig)
Go - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Fri Jan 26 20:34:28 GMT 2024 - 10.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
// Edge direction handled correctly assertThat(network.outDegree(N2)).isEqualTo(0); } @Test public void edges_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.edges()).containsExactly(E11); } @Test public void incidentEdges_selfLoop() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.incidentEdges(N1)).containsExactly(E11); } @Test public void incidentNodes_selfLoop() { assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(network.incidentNodes(E11).source()).isEqualTo(N1); assertThat(network.incidentNodes(E11).target()).isEqualTo(N1); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Returns a view of {@code network} with the direction (if any) of every edge reversed. All other * properties remain intact, and further updates to {@code network} will be reflected in the view. */ public static <N, E> Network<N, E> transpose(Network<N, E> network) { if (!network.isDirected()) { return network; // the transpose of an undirected network is an identical network }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
assertThat(network.incidentEdges(node).size() + selfLoopCount) .isEqualTo(network.inDegree(node) + network.outDegree(node)); assertThat(network.inEdges(node)).hasSize(network.inDegree(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
assertThat(network.incidentEdges(node).size() + selfLoopCount) .isEqualTo(network.inDegree(node) + network.outDegree(node)); assertThat(network.inEdges(node)).hasSize(network.inDegree(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0)