- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for getVertices (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
private MetadataGraph findLinkedSubgraph(MetadataGraph g) { if (g.getVertices().size() == 1) { return g; } List<MetadataGraphVertex> visited = new ArrayList<>(g.getVertices().size()); visit(g.getEntry(), visited, g); List<MetadataGraphVertex> dropList = new ArrayList<>(g.getVertices().size()); // collect drop list
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Jul 23 17:27:08 GMT 2025 - 7.4K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultClasspathTransformation.java
protected ClasspathGraphVisitor(MetadataGraph cleanGraph, ClasspathContainer cpc) { this.cpc = cpc; this.graph = cleanGraph; visited = new ArrayList<>(cleanGraph.getVertices().size()); } // ----------------------------------------------------------------------- protected void visit(MetadataGraphVertex node) { ArtifactMetadata md = node.getMd();
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Jul 23 17:27:08 GMT 2025 - 5.1K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
public MetadataGraphVertex getEntry() { return entry; } public void setEntry(MetadataGraphVertex entry) { this.entry = entry; } public TreeSet<MetadataGraphVertex> getVertices() { return vertices; } public List<MetadataGraphEdge> getIncidentEdges(MetadataGraphVertex vertex) { checkEdges(); return incidentEdges.get(vertex); }
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Jul 23 17:27:08 GMT 2025 - 13K bytes - Click Count (0)