Galapagos theoretical question

I have a mesh and I would like to make optimization of a corresponding geometry at every vertex point of the mesh. There are different number of edges coming to the vertexes. It is ranging from three to six. 

Is it possible to make a solution which can walk through every different vertex and make an optimization there, and when galapagos meets the target number (or after a certain time) jumps to the next vertex? Is it possible to handle the problem that in some vertex the optimization involves only three sliders (because of the thee edges) and in some others there are six sliders and in some vertices in beetween?