- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 102 for Graph (0.48 sec)
-
android/guava/src/com/google/common/graph/Graph.java
* MutableGraph<Integer> graph = GraphBuilder.undirected().build(); * }</pre> * * <p>{@link GraphBuilder#build()} returns an instance of {@link MutableGraph}, which is a subtype * of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not * need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on the graph),
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental_graph.cc
// into the list of outputs for the operation. class GraphTensor : public TracingTensorHandle { public: explicit GraphTensor(TF_Output output, TF_Graph* graph) : TracingTensorHandle(kGraph), output_(output), graph_(graph) {} tensorflow::DataType DataType() const override { return static_cast<tensorflow::DataType>(TF_OperationOutputType(output_)); } tensorflow::Status Shape(
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Mar 12 20:00:09 GMT 2024 - 15.4K bytes - Viewed (1) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
MutableValueGraph<Integer, String> graph; @After public void validateGraphState() { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph)); Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
assertThat(graph.requestedNodes).containsExactly('a', 'a', 'a', 'b', 'b'); } @Test public void forGraph_breadthFirstIterable_iterableIsLazy() { RequestSavingGraph graph = new RequestSavingGraph(DIAMOND_GRAPH); Iterable<Character> result = Traverser.forGraph(graph).breadthFirst(charactersOf("ab")); assertEqualCharNodes(Iterables.limit(result, 2), "ab");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
tensorflow/c/c_api_function.cc
tensorflow::mutex_lock l(g->mu); return g->graph.flib_def().num_functions(); } int TF_GraphGetFunctions(TF_Graph* g, TF_Function** funcs, int max_func, TF_Status* status) { tensorflow::FunctionDefLibrary lib; { tensorflow::mutex_lock l(g->mu); lib = g->graph.flib_def().ToProto(); }
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 13.6K bytes - Viewed (2) -
tensorflow/c/experimental/grappler/grappler_test.cc
TF_Status* status = TF_NewStatus(); TF_GraphProperties* graph_properties = TF_NewGraphProperties(reinterpret_cast<TF_GrapplerItem*>(&item)); TF_InferStatically(graph_properties, true, false, false, false, status); EXPECT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status); for (const NodeDef& node : item.graph.node()) { if (node.op() == "AddN") { int num_values = 0;
C++ - Registered: Tue Feb 27 12:39:08 GMT 2024 - Last Modified: Thu Apr 13 22:30:58 GMT 2023 - 11.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5); assertThat(graph.adjacentNodes(N2)).containsExactly(N3); assertThat(graph.adjacentNodes(N3)).containsExactly(N2); assertThat(graph.adjacentNodes(N4)).containsExactly(N1); assertThat(graph.adjacentNodes(N5)).containsExactly(N1); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
import org.apache.maven.api.model.Parent; import org.apache.maven.api.model.Plugin; import org.apache.maven.artifact.ArtifactUtils; import org.apache.maven.project.Graph.Vertex; /** * ProjectSorter */ public class ProjectSorter { private Graph graph; private List<MavenProject> sortedProjects; private Map<String, MavenProject> projectMap; /** * Sort a list of projects. * <ul>
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 10.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ValueGraphTest.java
MutableValueGraph<Integer, String> graph; @After public void validateGraphState() { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph)); Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 17.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0)