Programming

vector<vector<int> >::iterator path_iterator;
vector<int>::iterator path_iterator;
vector<int> check_path;

   // to each path1[i], try to add a neighbor of last_vertex
   for(j=0; j<last_vertex_delta; j++) {
      current_neighbor = vertex_list[last_vertex_in_path].neighbor_nums[j];

      // copy from vec<vec<int>> to temp vec, probably not necessary
      check_path = new_set_of_paths[path_count];

      // search path to see if current_neighbor is already part of path
      path_iterator = find_if(check_path.begin(),
                              check_path.end(),
                              current_neighbor);

      cout << "last_atom_in_path " << last_atom_in_path << endl;
      cout << "current_neighbor " << current_neighbor << endl;
      cout << "path_iterator " << * path_iterator << endl;
      cout << endl;

      // if the neighbor isn't already part of the path, add it
      if(path_iterator == check_path.end()) {
         new_set_of_paths[path_count].push_back( current_neighbor );
         path_count ++;
      }

      check_path.clear();
   }

      path_iterator = find(check_path.begin(),
                           check_path.end(),
                           current_neighbor);

      cout << "last_atom_in_path " << last_atom_in_path << endl;
      cout << "current_neighbor " << current_neighbor << endl;
      cout << "path_iterator " << * path_iterator << endl;
      cout << endl;

      // if the neighbor isn't alreay part of the path, add it
      if(path_iterator == 0) {
         new_set_of_paths[path_count].push_back( current_neighbor );
         path_count ++;
      }