- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 215 for Graph (0.15 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 May 05 03:35:11 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 May 05 03:35:11 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 May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K 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 30 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 30 12:39:09 GMT 2024 - Last Modified: Mon Mar 04 19:49:06 GMT 2024 - 1.8K bytes - Viewed (0) -
.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 May 08 11:36:15 GMT 2024 - Last Modified: Thu May 02 09:13:16 GMT 2024 - 1.1K bytes - Viewed (2) -
maven-core/src/test/java/org/apache/maven/lifecycle/internal/builder/multithreaded/ConcurrencyDependencyGraphTest.java
assertEquals(1, graph.getFinishedProjects().size()); graph.markAsFinished(ProjectDependencyGraphStub.A); // still only A assertEquals(1, graph.getFinishedProjects().size()); Set<MavenProject> unfinishedProjects = graph.getUnfinishedProjects(); assertEquals(5, unfinishedProjects.size()); graph.markAsFinished(schedulableNewProcesses.get(0));
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Sat Apr 15 17:24:20 GMT 2023 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* * <p>Examples of use: * * <pre>{@code * // Building a mutable graph * MutableGraph<String> graph = GraphBuilder.undirected().allowsSelfLoops(true).build(); * graph.putEdge("bread", "bread"); * graph.putEdge("chocolate", "peanut butter"); * graph.putEdge("peanut butter", "jelly"); * * // Building an immutable graph * ImmutableGraph<String> immutableGraph = * GraphBuilder.undirected()
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
Iterator<N> successorIterator = ImmutableSet.<N>of().iterator(); static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph); } private EndpointPairIterator(BaseGraph<N> graph) { this.graph = graph; this.nodeIterator = graph.nodes().iterator(); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/PackageSanityTests.java
MutableNetwork<String, String> mutableNetworkB = NetworkBuilder.directed().build(); mutableNetworkB.addNode("b"); setDistinctValues(AbstractGraphBuilder.class, GRAPH_BUILDER_A, GRAPH_BUILDER_B); setDistinctValues(Graph.class, IMMUTABLE_GRAPH_A, IMMUTABLE_GRAPH_B); setDistinctValues(MutableNetwork.class, mutableNetworkA, mutableNetworkB); setDistinctValues(NetworkBuilder.class, NETWORK_BUILDER_A, NETWORK_BUILDER_B);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0)