public static void setUp()

in src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java [56:83]

25 lines of code
4 McCabe index (conditional complexity)


    public static void setUp()
    {
        graph = newDirectedMutableGraph( new AbstractGraphConnection<BaseLabeledVertex, BaseLabeledEdge>()
        {
            public void connect()
            {
                List<BaseLabeledVertex> vertices = new ArrayList<BaseLabeledVertex>();
                for ( int i = 0; i < NODES; i++ )
                {
                    BaseLabeledVertex v = new BaseLabeledVertex( valueOf( i ) );
                    addVertex( v );
                    vertices.add( v );
                }

                Random r = new Random();
                for ( int i = 0; i < EDGES; i++ ) {
                    int v1 = r.nextInt(NODES);
                    int v2 = r.nextInt(NODES);

                    try {
                        addEdge( new BaseLabeledEdge( format( "%s -> %s", v1, v2 ) ) ).from( vertices.get( v1 ) ).to( vertices.get( v2 ) );
                    } catch (GraphException e) {
                        // ignore duplicate edge exceptions
                    }
                }
            }
        } );
    }