- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 379 for graaph (0.17 sec)
-
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
Graph graph3 = new Graph(); graph3.addVertex("a"); graph3.addVertex("b"); graph3.addVertex("c"); graph3.addVertex("d"); graph3.addVertex("e"); graph3.addVertex("f"); addEdge(graph3, "a", "b"); addEdge(graph3, "b", "c"); addEdge(graph3, "b", "d"); addEdge(graph3, "c", "d"); addEdge(graph3, "c", "e"); addEdge(graph3, "f", "d");
Java - Registered: Sun Apr 21 03:35:09 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* "Choosing the right graph type"</a> section of the Guava User Guide for more details. * * <h3>Capabilities</h3> * * <p>{@code Graph} supports the following use cases (<a * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of * terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow self-loops
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ public static <N> Graph<N> transpose(Graph<N> graph) { if (!graph.isDirected()) { return graph; // the transpose of an undirected graph is an identical graph } if (graph instanceof TransposedGraph) { return ((TransposedGraph<N>) graph).graph; } return new TransposedGraph<>(graph); } /**
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
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 21 03:35:09 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K 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/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) -
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 21 03:35:09 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TestUtil.java
} static void assertStronglyEquivalent(Graph<?> graphA, Graph<?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals()
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TestUtil.java
} static void assertStronglyEquivalent(Graph<?> graphA, Graph<?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals()
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K 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 21 03:35:09 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0)