Really go through all neighbors of a vertex.

git-svn-id: https://svn.dealii.org/trunk@27025 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/source/grid/grid_tools.cc b/deal.II/source/grid/grid_tools.cc
index 668d238b18bb0abe87a8e6736d7ad923fc428230..d67815fbe81e6946ed603fca7b025c300c588358 100644 (file)
--- a/deal.II/source/grid/grid_tools.cc
+++ b/deal.II/source/grid/grid_tools.cc
@@ -736,7 +736,7 @@ namespace GridTools
                         &&
                         cell->neighbor(face)->active())
                       {
-                        // there is a (possibly )coarser cell behind a
+                        // there is a (possibly) coarser cell behind a
                         // face to which the vertex belongs. the
                         // vertex we are looking at is then either a
                         // vertex of that coarser neighbor, or it is a
@@ -747,7 +747,6 @@ namespace GridTools
                         // std::set makes sure that we get it only
                         // once)
                         adjacent_cells.insert (cell->neighbor(face));
-                        goto next_cell;
                       }
                   }