Guido, > The easiest way is looping over all cells and over all faces of the > cell. For each face, store the cell and its neighbor and set the user > flag so you don't do the face twice.
I think we are not talking about having access to the two cells that share a face but to all cells that share a vertex with the face, which is a larger but a priori unknown number, see the original post below. Best, Tobias > >> I'm looking for a way to build up a list of adjacent cells of each > >> face, i.e. all cells that share a vertex with a given face. > >> Obviously a loop over all cells inside a loop over all faces is > >> prohibitively expensive. Is there a more clever way to achieve this in > >> deal? > >> > >> Thanks > >> Christian _______________________________________________ dealii mailing list http://poisson.dealii.org/mailman/listinfo/dealii
