- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for vertex (0.35 sec)
-
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
} final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id); } 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 {
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
} final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id); } 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 {
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
} cycle.removeLast(); stateMap.put(v, DfsState.VISITED); } else if (state == DfsState.VISITING) { // we are already visiting this vertex, this mean we have a cycle int pos = cycle.lastIndexOf(v); List<String> ret = cycle.subList(pos, cycle.size()); ret.add(v); return ret;
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0)