org/codehaus/plexus/util/dag/DAG.class package org.codehaus.plexus.util.dag; public synchronized class DAG implements Cloneable, java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public...

        graph.addVertex("a");
        assertEquals(1, graph.getVertices().size());
        assertEquals("a", graph.getVertex("a").getLabel());
        graph.addVertex("a");
        assertEquals(1, graph.getVertices().size());
        assertEquals("a", graph.getVertex("a").getLabel());

        graph.addVertex("b");
        assertEquals(2, graph.getVertices().size());
        assertFalse(hasEdge(graph, "a", "b"));

    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

        assertNotNull(res, "null graph after resolver");
        assertNotNull(res.getVertices(), "no vertices in the resulting graph after resolver");

        assertNotNull(res.getExcidentEdges(v1), "no edges in the resulting graph after resolver");

        assertEquals(4, res.getVertices().size(), "wrong # of vertices in the resulting graph after resolver");
        assertEquals(
                2,

        VISITED
    }

    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);
    }

        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();

        VISITED
    }

    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);
    }

            vertices.put(project.getVersion(), graph.addVertex(projectId));
        }

        for (Vertex projectVertex : graph.getVertices()) {
            String projectId = projectVertex.getLabel();

            MavenProject project = projectMap.get(projectId);

    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);
    }