- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for visitCycle (0.04 sec)
-
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/Graph.java
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<>()); if (cycle != null) { // remove edge which introduced cycle throw new CycleDetectedException(Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Tue Feb 25 08:27:34 UTC 2025 - 3.4K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/project/Graph.java
} private static List<String> visitCycle( Collection<Vertex> children, Map<Vertex, DfsState> stateMap, LinkedList<String> cycle) { for (Vertex v : children) { DfsState state = stateMap.putIfAbsent(v, DfsState.VISITING); if (state == null) { cycle.addLast(v.label); List<String> ret = visitCycle(v.children, stateMap, cycle);Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.1K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
} private static List<String> visitCycle( Collection<Vertex> children, Map<Vertex, DfsState> stateMap, LinkedList<String> cycle) { for (Vertex v : children) { DfsState state = stateMap.putIfAbsent(v, DfsState.VISITING); if (state == null) { cycle.addLast(v.label); List<String> ret = visitCycle(v.children, stateMap, cycle);Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.6K bytes - Viewed (0)