- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 115 for Hedger (0.29 sec)
-
android/guava/src/com/google/common/graph/BaseGraph.java
Set<N> nodes(); /** Returns all edges in this graph. */ Set<EndpointPair<N>> edges(); // // Graph properties // /** * Returns true if the edges in this graph are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ boolean isDirected();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
"wrong # of v2 incident edges in the resulting graph after resolver"); assertEquals( "1.2", res.getIncidentEdges(v2).get(0).getVersion(), "wrong edge v1-v2 in the resulting graph after resolver"); assertEquals( 1, res.getIncidentEdges(v3).size(), "wrong # of edges v1-v3 in the resulting graph after resolver");
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final String REUSING_EDGE = "Edge %s already exists between the following nodes: %s, " + "so it cannot be reused to connect the following nodes: %s."; static final String MULTIPLE_EDGES_CONNECTING = "Cannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling " + "edgesConnecting() instead."; static final String PARALLEL_EDGES_NOT_ALLOWED =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
tensorflow/c/eager/immediate_execution_operation.h
==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_OPERATION_H_ #define TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_OPERATION_H_ #include <memory> #include "absl/types/optional.h" #include "absl/types/span.h" #include "tensorflow/c/eager/abstract_operation.h" #include "tensorflow/c/eager/immediate_execution_tensor_handle.h" #include "tensorflow/c/tensor_interface.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Sep 26 22:40:32 GMT 2022 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
tensorflow/c/eager/abstract_tensor_handle.h
See the License for the specific language governing permissions and limitations under the License. ==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_ABSTRACT_TENSOR_HANDLE_H_ #define TENSORFLOW_C_EAGER_ABSTRACT_TENSOR_HANDLE_H_ #include <memory> #include "tensorflow/core/framework/full_type.pb.h" #include "tensorflow/core/framework/tensor_shape.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Mar 03 00:30:36 GMT 2023 - 3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
+ nodes() + ", edges: " + edgeValueMap(this); } private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) { return Maps.asMap( graph.edges(), edge -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null))); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
tensorflow/c/eager/immediate_execution_tensor_handle.h
limitations under the License. ==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_TENSOR_HANDLE_H_ #define TENSORFLOW_C_EAGER_IMMEDIATE_EXECUTION_TENSOR_HANDLE_H_ #include "tensorflow/c/eager/abstract_tensor_handle.h" #include "tensorflow/c/tensor_interface.h" #include "tensorflow/core/framework/types.pb.h" #include "tensorflow/core/platform/status.h"
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Mar 10 21:56:24 GMT 2023 - 4.3K bytes - Viewed (0)