public void discoverGraph()

in src/main/java/org/apache/commons/graph/visit/VisitGraphBuilder.java [54:69]

• 15 lines of code
• 3 McCabe index (conditional complexity)

    public void discoverGraph( G graph )
    {
        if ( graph instanceof DirectedGraph )
        {
            visitGraph = new DirectedMutableGraph<V, E>();
        }
        else
        {
            visitGraph = new UndirectedMutableGraph<V, E>();
        }

        for ( V vertex : graph.getVertices() )
        {
            visitGraph.addVertex( vertex );
        }
    }