void saveResults( List<List<NodeInfo>> graph ) {
		Grid g = foundGrids.grow();
		g.reset();

		g.columns = graph.get(0).size() + graph.get(1).size();
		g.rows = graph.size();

		for (int row = 0; row < g.rows; row++) {
			List<NodeInfo> list = graph.get(row);
			for (int i = 0; i < g.columns; i++) {
				if( (i%2) == (row%2))
					g.ellipses.add(list.get(i/2).ellipse );
				else
					g.ellipses.add(null);
			}
		}
	}
void saveResults ( List < List < NodeInfo > > graph ) { Grid g = foundGrids . grow ( ) ; g . reset ( ) ; g . columns = graph . get ( 0 ) . size ( ) + graph . get ( 1 ) . size ( ) ; g . rows = graph . size ( ) ; for ( int row = 0 ; row < g . rows ; row ++ ) { List < NodeInfo > list = graph . get ( row ) ; for ( int i = 0 ; i < g . columns ; i ++ ) { if ( ( i % 2 ) == ( row % 2 ) ) g . ellipses . add ( list . get ( i / 2 ) . ellipse ) ; else g . ellipses . add ( null ) ; } } }
Combines the inner and outer grid into one grid for output.  See {@link Grid} for a discussion
on how elements are ordered internally.