public Iterable getConnectedVertices()

in src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java [63:76]

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

    public Iterable<V> getConnectedVertices( V v )
    {

        List<V> tmp = new ArrayList<V>();
        for ( V originalVertex : graph.getConnectedVertices( v ) )
        {
            if ( getEdge( v, originalVertex ) != null )
            {
                tmp.add( originalVertex );
            }
        }

        return tmp;
    }