From: Wolfgang Bangerth Date: Tue, 9 Oct 2012 12:44:57 +0000 (+0000) Subject: Really go through all neighbors of a vertex. X-Git-Tag: v8.0.0~1974 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=954510faeb40730f4d91d4441a88afa468b7238e;p=dealii.git 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 668d238b18..d67815fbe8 100644 --- 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; } }