diff --git a/example_apps/application_template.cpp b/example_apps/application_template.cpp
index a8773c44..80899282 100644
--- a/example_apps/application_template.cpp
+++ b/example_apps/application_template.cpp
@@ -54,7 +54,7 @@ struct MyGraphChiProgram : public GraphChiProgram<VertexDataType, EdgeDataType>
      */
     void update(graphchi_vertex<VertexDataType, EdgeDataType> &vertex, graphchi_context &gcontext) {
 
-        if (ginfo.iteration == 0) {
+        if (gcontext.iteration == 0) {
             /* On first iteration, initialize vertex (and its edges). This is usually required, because
                on each run, GraphChi will modify the data files. To start from scratch, it is easiest
                do initialize the program in code. Alternatively, you can keep a copy of initial data files. */
diff --git a/example_apps/inmemconncomps.cpp b/example_apps/inmemconncomps.cpp
index 5f6c84dc..6f17af5d 100644
--- a/example_apps/inmemconncomps.cpp
+++ b/example_apps/inmemconncomps.cpp
@@ -82,7 +82,11 @@ struct ConnectedComponentsProgram : public GraphChiProgram<VertexDataType, EdgeD
         assert(gcontext.scheduler != NULL);
         
         /* On subsequent iterations, find the minimum label of my neighbors */
-        vid_t curmin = vertex.get_data();
+        vid_t curmin;
+        if(gcontext.iteration == 0)
+            curmin = vertex_values[vertex.id()];
+        else
+            curmin = vertex.get_data();
         for(int i=0; i < vertex.num_edges(); i++) {
             vid_t nblabel = neighbor_value(vertex.edge(i));
             curmin = std::min(nblabel, curmin);