def execute
      graph = Digraph.new{|g|
        vertex_count.times do |i|
          vertex = g.add_vertex
          vertex_builder.call(vertex,i) if vertex_builder
        end
        edge_count.times do |i|
          source = g.ith_vertex(Kernel.rand(vertex_count))
          target = g.ith_vertex(Kernel.rand(vertex_count))
          edge = g.connect(source, target)
          edge_builder.call(edge,i) if edge_builder
        end
      }
      strip ? _strip(graph) : graph
    end
def execute
      graph = Digraph.new{|g|
        vertex_count.times do |i|
          vertex = g.add_vertex
          vertex_builder.call(vertex,i) if vertex_builder
        end
        edge_count.times do |i|
          source = g.ith_vertex(Kernel.rand(vertex_count))
          target = g.ith_vertex(Kernel.rand(vertex_count))
          edge = g.connect(source, target)
          edge_builder.call(edge,i) if edge_builder
        end
      }
      strip ? _strip(graph) : graph
    end
Creates an algorithm instance
 Executes the random generation