- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 53 for addEdge (0.19 sec)
-
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
edgeToReferenceNode.put(edge, nodeU); return true; } @Override @CanIgnoreReturnValue public boolean addEdge(EndpointPair<N> endpoints, E edge) { validateEndpoints(endpoints); return addEdge(endpoints.nodeU(), endpoints.nodeV(), edge); } @Override @CanIgnoreReturnValue public boolean removeNode(N node) { checkNotNull(node, "node");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardMutableUndirectedNetworkTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 09 17:01:22 GMT 2020 - 2.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardMutableUndirectedNetworkTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Apr 09 17:01:22 GMT 2020 - 2.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardMutableDirectedNetworkTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Apr 09 17:01:22 GMT 2020 - 2.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Integer> nodeList = new ArrayList<>(network.nodes()); for (int i = 0; i < NUM_EDGES; ++i) { // Parallel edges are allowed, so this should always succeed. assertThat( network.addEdge( getRandomElement(nodeList, gen), getRandomElement(nodeList, gen), new Object())) .isTrue(); } ArrayList<Object> edgeList = new ArrayList<>(network.edges());
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) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
ArrayList<Integer> nodeList = new ArrayList<>(network.nodes()); for (int i = 0; i < NUM_EDGES; ++i) { // Parallel edges are allowed, so this should always succeed. assertThat( network.addEdge( getRandomElement(nodeList, gen), getRandomElement(nodeList, gen), new Object())) .isTrue(); } ArrayList<Object> edgeList = new ArrayList<>(network.edges());
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) -
android/guava/src/com/google/common/graph/MutableNetwork.java
* @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsParallelEdges()} or {@link #allowsSelfLoops()} */ @CanIgnoreReturnValue boolean addEdge(N nodeU, N nodeV, E edge); /** * Adds {@code edge} connecting {@code endpoints}. In an undirected network, {@code edge} will * also connect {@code nodeV} to {@code nodeU}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
{ ArtifactMetadata md = node.getMd(); MetadataGraphEdge e = new MetadataGraphEdge(md.version, md.resolved, md.artifactScope, md.artifactUri, depth, pomOrder); addEdge(parentVertex, vertex, e); } else { entry = vertex; } MetadataTreeNode[] kids = node.getChildren(); if (kids == null || kids.length < 1) { return;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
import java.util.LinkedList; 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)) {
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
public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); } void addEdge(Vertex from, Vertex to) throws CycleDetectedException { from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) {
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)