Kaushik, You could use get_face_connectivity_of_cells() <https://dealii.org/current/doxygen/deal.II/namespaceGridTools.html#a002fd376a184234ccbf5eca8f8fd7012> or get_vertex_connectivity_of_cells() <https://dealii.org/current/doxygen/deal.II/namespaceGridTools.html#ab54e2fb68484ddaedaab56de13323169> (depending on what you mean by connected) to have a sparsity pattern. This maps to a graph where the nodes are the cells, now you just need to check if the graph is connected see here <https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Computational_aspects>
Best, Bruno On Monday, July 10, 2023 at 10:33:21 AM UTC-4 k.d...@gmail.com wrote: > Hi all, > Is there any way to find or count number of unconnected regions in a > triangulation. Triangulation will have non zero refinement levels. > Thanks, > Kaushik > -- The deal.II project is located at http://www.dealii.org/ For mailing list/forum options, see https://groups.google.com/d/forum/dealii?hl=en --- You received this message because you are subscribed to the Google Groups "deal.II User Group" group. To unsubscribe from this group and stop receiving emails from it, send an email to dealii+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/c77b5d42-9228-497a-ab2b-2ac25dc06fb7n%40googlegroups.com.
