blob: e597b2092600ad9b0ac635a087424da87b105218 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
// This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _IFGraph_Articulations_HeaderFile
#define _IFGraph_Articulations_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Interface_Graph_HeaderFile
#include <Interface_Graph.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _Handle_TColStd_HSequenceOfInteger_HeaderFile
#include <Handle_TColStd_HSequenceOfInteger.hxx>
#endif
#ifndef _Interface_GraphContent_HeaderFile
#include <Interface_GraphContent.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
#ifndef _Handle_Standard_Transient_HeaderFile
#include <Handle_Standard_Transient.hxx>
#endif
class TColStd_HSequenceOfInteger;
class Interface_Graph;
class Standard_Transient;
class Interface_EntityIterator;
//! this class gives entities which are Articulation points <br>
//! in a whole Model or in a sub-part <br>
//! An Articulation Point divides the graph in two (or more) <br>
//! disconnected sub-graphs <br>
//! Identifying Articulation Points allows improving <br>
//! efficiency of spliting a set of Entities into sub-sets <br>
class IFGraph_Articulations : public Interface_GraphContent {
public:
void* operator new(size_t,void* anAddress)
{
return anAddress;
}
void* operator new(size_t size)
{
return Standard::Allocate(size);
}
void operator delete(void *anAddress)
{
if (anAddress) Standard::Free((Standard_Address&)anAddress);
}
//! creates Articulations to evaluate a Graph <br>
//! whole True : works on the whole Model <br>
//! whole False : remains empty, ready to work on a sub-part <br>
Standard_EXPORT IFGraph_Articulations(const Interface_Graph& agraph,const Standard_Boolean whole);
//! adds an entity and its shared ones to the list <br>
Standard_EXPORT void GetFromEntity(const Handle(Standard_Transient)& ent) ;
//! adds a list of entities (as an iterator) <br>
Standard_EXPORT void GetFromIter(const Interface_EntityIterator& iter) ;
//! Allows to restart on a new data set <br>
Standard_EXPORT void ResetData() ;
//! Evaluates the list of Articulation points <br>
Standard_EXPORT virtual void Evaluate() ;
protected:
private:
//! basic routine of computation <br>
//! (see book Sedgewick "Algorithms", p 392) <br>
Standard_EXPORT Standard_Integer Visit(const Standard_Integer num) ;
Interface_Graph thegraph;
Standard_Integer thenow;
Handle_TColStd_HSequenceOfInteger thelist;
};
// other Inline functions and methods (like "C++: function call" methods)
#endif
|
