include/opencascade/IFGraph_Articulations.hxx

0001 // Created on: 1992-09-23
0002 // Created by: Christian CAILLET
0003 // Copyright (c) 1992-1999 Matra Datavision
0004 // Copyright (c) 1999-2014 OPEN CASCADE SAS
0005 //
0006 // This file is part of Open CASCADE Technology software library.
0007 //
0008 // This library is free software; you can redistribute it and/or modify it under
0009 // the terms of the GNU Lesser General Public License version 2.1 as published
0010 // by the Free Software Foundation, with special exception defined in the file
0011 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
0012 // distribution for complete text of the license and disclaimer of any warranty.
0013 //
0014 // Alternatively, this file may be used under the terms of Open CASCADE
0015 // commercial license or contractual agreement.
0016
0017 #ifndef _IFGraph_Articulations_HeaderFile
0018 #define _IFGraph_Articulations_HeaderFile
0019
0020 #include <Standard.hxx>
0021 #include <Standard_DefineAlloc.hxx>
0022 #include <Standard_Handle.hxx>
0023
0024 #include <Interface_Graph.hxx>
0025 #include <Standard_Integer.hxx>
0026 #include <TColStd_HSequenceOfInteger.hxx>
0027 #include <Interface_GraphContent.hxx>
0028 #include <Standard_Boolean.hxx>
0029 class Standard_Transient;
0030 class Interface_EntityIterator;
0031
0032 //! this class gives entities which are Articulation points
0033 //! in a whole Model or in a sub-part
0034 //! An Articulation Point divides the graph in two (or more)
0035 //! disconnected sub-graphs
0036 //! Identifying Articulation Points allows improving
0037 //! efficiency of splitting a set of Entities into sub-sets
0038 class IFGraph_Articulations  : public Interface_GraphContent
0039 {
0040 public:
0041
0042   DEFINE_STANDARD_ALLOC
0043
0044   //! creates Articulations to evaluate a Graph
0045   //! whole True : works on the whole Model
0046   //! whole False : remains empty, ready to work on a sub-part
0047   Standard_EXPORT IFGraph_Articulations(const Interface_Graph& agraph, const Standard_Boolean whole);
0048
0049   //! adds an entity and its shared ones to the list
0050   Standard_EXPORT void GetFromEntity (const Handle(Standard_Transient)& ent);
0051
0052   //! adds a list of entities (as an iterator)
0053   Standard_EXPORT void GetFromIter (const Interface_EntityIterator& iter);
0054
0055   //! Allows to restart on a new data set
0056   Standard_EXPORT void ResetData();
0057
0058   //! Evaluates the list of Articulation points
0059   Standard_EXPORT virtual void Evaluate() Standard_OVERRIDE;
0060
0061 private:
0062
0063   //! basic routine of computation
0064   //! (see book Sedgewick "Algorithms", p 392)
0065   Standard_EXPORT Standard_Integer Visit (const Standard_Integer num);
0066
0067 private:
0068
0069   Interface_Graph thegraph;
0070   Standard_Integer thenow;
0071   Handle(TColStd_HSequenceOfInteger) thelist;
0072
0073 };
0074
0075 #endif // _IFGraph_Articulations_HeaderFile