- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for addEdge (0.16 sec)
-
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelTransformerContextBuilder.java
// gathered with problem collector } return null; } }; } private boolean addEdge(Path from, Path p, DefaultModelProblemCollector problems) { try { dag.addEdge(from.toString(), p.toString()); return true; } catch (Graph.CycleDetectedException e) { problems.add(new DefaultModelProblem(
Java - Registered: Sun Apr 21 03:35:09 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 9.3K 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/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 Apr 21 03:35:09 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.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 Apr 21 03:35:09 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
for (E edge : network.outEdges(node)) { N successorNode = network.incidentNodes(edge).adjacentNode(node); if (subgraph.nodes().contains(successorNode)) { subgraph.addEdge(node, successorNode, edge); } } } return subgraph; } /** Creates a mutable copy of {@code graph} with the same nodes and edges. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)