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...

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...

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...

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...

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...

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...

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...

                }
            }
            // System.err.println("Original graph("+graph.getVertices().size()+"):\n"+graph.toString());
            // System.err.println("Cleaned("+requestedScope+") graph("+res.getVertices().size()+"):\n"+res.toString());
            // System.err.println("Linked("+requestedScope+")
            // subgraph("+linkedRes.getVertices().size()+"):\n"+linkedRes.toString());
            return findLinkedSubgraph(res);

        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,

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