OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-04 13:13:25 +03:00
Code Activity

0031939: Coding - correction of spelling errors in comments [part 4]

Browse Source 
Fix various typos

Fixed via `codespell v2.1.dev
This commit is contained in:
luz paz
2020-12-16 11:58:16 +03:00
committed by bugmaster
parent 7fb9d6d573
commit 0177fe2617
196 changed files with 476 additions and 1351 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/IFGraph/IFGraph_Articulations.hxx
View File

@@ -30,20 +30,18 @@ class Interface_Graph;
class Standard_Transient;
class Interface_EntityIterator;
//! this class gives entities which are Articulation points
//! in a whole Model or in a sub-part
//! An Articulation Point divides the graph in two (or more)
//! disconnected sub-graphs
//! Identifying Articulation Points allows improving
//! efficiency of spliting a set of Entities into sub-sets
//! efficiency of splitting a set of Entities into sub-sets
class IFGraph_Articulations : public Interface_GraphContent
{
public:
DEFINE_STANDARD_ALLOC
//! creates Articulations to evaluate a Graph
//! whole True : works on the whole Model
//! whole False : remains empty, ready to work on a sub-part
@@ -61,34 +59,18 @@ public:
//! Evaluates the list of Articulation points
Standard_EXPORT virtual void Evaluate() Standard_OVERRIDE;
protected:
private:
//! basic routine of computation
//! (see book Sedgewick "Algorithms", p 392)
Standard_EXPORT Standard_Integer Visit (const Standard_Integer num);
private:
Interface_Graph thegraph;
Standard_Integer thenow;
Handle(TColStd_HSequenceOfInteger) thelist;
};
#endif // _IFGraph_Articulations_HeaderFile

2
src/IFGraph/IFGraph_ConnectedComponants.cxx
View File

@@ -19,7 +19,7 @@
// Pour travailler, ConnectedComponants exploite AllConnected :
// On prend un 1er Vertex, on determine ses AllConnected -> voila un 1er
// Connected Componant
// Connected Component
// On recommence jusqu'a ce qu'il n'y ait plus de Vertex libre
// Honnetement, si ca ne marche pas, cf classe ConnectedVerticesIterator
// de GraphTools qui fait en principe la meme chose

27
src/IFGraph/IFGraph_ConnectedComponants.hxx
View File

@@ -25,15 +25,13 @@
#include <Standard_Boolean.hxx>
class Interface_Graph;
//! determines Connected Componants in a Graph. They define
//! disjoined sets of Entities
//! determines Connected Components in a Graph.
//! They define disjoined sets of Entities.
class IFGraph_ConnectedComponants : public IFGraph_SubPartsIterator
{
public:
DEFINE_STANDARD_ALLOC
//! creates with a Graph, and will analyse :
//! whole True : all the contents of the Model
@@ -43,27 +41,6 @@ public:
//! does the computation
Standard_EXPORT virtual void Evaluate() Standard_OVERRIDE;
protected:
private:
};
#endif // _IFGraph_ConnectedComponants_HeaderFile