- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 338 for Graph (0.18 sec)
-
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
* specific language governing permissions and limitations * under the License. */ package org.apache.maven.internal.impl; import java.util.*; import org.apache.maven.project.CycleDetectedException; class Graph { private enum DfsState { VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id);
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
import java.util.List; import java.util.Map; import java.util.Set; class Graph { final Map<String, Set<String>> graph = new LinkedHashMap<>(); synchronized void addEdge(String from, String to) throws CycleDetectedException { if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) { List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>());
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
* KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. */ package org.apache.maven.project; import java.util.*; class Graph { private enum DfsState { VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id);
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0) -
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/graph_function.cc
==============================================================================*/ #include "tensorflow/c/eager/graph_function.h" #include <utility> #include "tensorflow/c/eager/abstract_function.h" #include "tensorflow/core/framework/function.h" #include "tensorflow/core/platform/status.h" namespace tensorflow { namespace tracing { namespace graph { GraphFunction::GraphFunction(FunctionDef fdef) : AbstractFunction(kGraph),
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Mar 04 19:49:06 GMT 2024 - 1.3K bytes - Viewed (0) -
tensorflow/c/eager/graph_function.h
==============================================================================*/ #ifndef TENSORFLOW_C_EAGER_GRAPH_FUNCTION_H_ #define TENSORFLOW_C_EAGER_GRAPH_FUNCTION_H_ #include "tensorflow/c/eager/abstract_function.h" #include "tensorflow/core/framework/function.h" #include "tensorflow/core/platform/refcount.h" namespace tensorflow { namespace tracing { namespace graph { using tensorflow::AbstractFunction; // Thin wrapper around a FunctionDef.
C - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Mar 04 19:49:06 GMT 2024 - 1.8K 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 23 12:39:09 GMT 2024 - Last Modified: Tue Mar 12 20:00:09 GMT 2024 - 15.4K bytes - Viewed (1) -
.github/workflows/submit-github-dependency-graph.yml
env: # Exclude some projects and configurations that should not contribute to the dependency graph DEPENDENCY_GRAPH_EXCLUDE_PROJECTS: ':docs|:internal-performance-testing|:enterprise-plugin-performance|:performance|:internal-integ-testing'
Others - Registered: Wed Apr 24 11:36:11 GMT 2024 - Last Modified: Tue Apr 16 09:18:51 GMT 2024 - 1.1K bytes - Viewed (2) -
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/GraphPropertiesTest.java
public void hasCycle_isolatedNodes() { for (MutableGraph<Integer> graph : graphsToTest) { graph.addNode(1); graph.addNode(2); } assertThat(hasCycle(directedGraph)).isFalse(); assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test public void hasCycle_oneEdge() { for (MutableGraph<Integer> graph : graphsToTest) { graph.putEdge(1, 2); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 07 15:09:01 GMT 2016 - 5.7K bytes - Viewed (0)