BRepGraph_Compact Class Reference

Graph compaction algorithm that reclaims removed node slots. More...

#include <BRepGraph_Compact.hxx>

Data Structures
struct	Options
	Configuration for compaction. More...
struct	Result
	Result counters for diagnostics. More...

Static Public Member Functions
static Result	Perform (BRepGraph &theGraph)
	Run compaction with default options.
static Result	Perform (BRepGraph &theGraph, const Options &theOptions)
	Run compaction with specified options.

Detailed Description

Graph compaction algorithm that reclaims removed node slots.

After deduplication or other operations that mark nodes as removed, this algorithm rebuilds the graph with dense index arrays, eliminating all removed nodes and reassigning indices to be contiguous.

Strategy: rebuild-and-swap. A fresh BRepGraph is constructed from non-removed nodes with remapped indices, then move-assigned into the input graph.

Member Function Documentation

Perform() [1/2]

static Result BRepGraph_Compact::Perform ( BRepGraph & theGraph )

static

Run compaction with default options.

Parameters

[in,out]

theGraph

graph to compact

Returns

compaction statistics

Perform() [2/2]

static Result BRepGraph_Compact::Perform ( BRepGraph & theGraph, const Options & theOptions )

static

Run compaction with specified options.

Parameters

[in,out]	theGraph	graph to compact
[in]	theOptions	compaction configuration

Returns

compaction statistics

---

The documentation for this class was generated from the following file:

• BRepGraph_Compact.hxx