#include <DynamicGraph.h>
|
| | FDynamicGraph () |
| |
| virtual | ~FDynamicGraph () |
| |
| int | Timestamp () const |
| |
| int | ShapeTimestamp () const |
| |
| int | VertexCount () const |
| |
| int | EdgeCount () const |
| |
| int | MaxVertexID () const |
| |
| int | MaxEdgeID () const |
| |
| int | MaxGroupID () const |
| |
| bool | IsVertex (int VID) const |
| |
| bool | IsEdge (int EID) const |
| |
| FSmallListSet::MappedValueEnumerable | VtxVerticesItr (int VID) const |
| |
| FSmallListSet::ValueEnumerable | VtxEdgesItr (int VID) const |
| |
| int | GetVtxEdgeCount (int VID) const |
| |
| int | GetMaxVtxEdgeCount () const |
| |
| FIndex2i | GetEdgeV (int EID) const |
| |
| int | GetEdgeGroup (int EID) const |
| |
| void | SetEdgeGroup (int EID, int GroupID) |
| |
| int | AllocateEdgeGroup () |
| |
| FEdge | GetEdge (int EID) const |
| |
| int | AppendEdge (const FEdge &E) |
| |
| int | AppendEdge (const FIndex2i &ev, int GID=-1) |
| |
| int | AppendEdge (int v0, int v1, int GID=-1) |
| |
| vertex_iterator | VertexIndices () const |
| |
| edge_iterator | EdgeIndices () const |
| |
| value_iteration< FEdge > | Edges () const |
| |
| int | FindEdge (int VA, int VB) const |
| |
| EMeshResult | RemoveEdge (int EID, bool bRemoveIsolatedVertices) |
| |
| EMeshResult | RemoveVertex (int VID, bool bRemoveIsolatedVertices) |
| |
| EMeshResult | SplitEdge (int VA, int VB, FEdgeSplitInfo &Split) |
| |
| EMeshResult | SplitEdge (int EAB, FEdgeSplitInfo &Split) |
| |
| EMeshResult | SplitEdgeWithExistingVertex (int EAB, int ExistingMidVert, FEdgeSplitInfo &Split) |
| |
| EMeshResult | CollapseEdge (int VKeep, int VRemove, FEdgeCollapseInfo &Collapse) |
| |
| bool | IsCompact () const |
| |
| bool | IsCompactV () const |
| |
| bool | IsBoundaryVertex (int VID) const |
| |
| bool | IsJunctionVertex (int VID) const |
| |
| bool | IsRegularVertex (int VID) const |
| |
| virtual bool | CheckValidity (EValidityCheckFailMode FailMode=EValidityCheckFailMode::Check) const |
| |
◆ edge_iterator
◆ value_iteration
◆ vertex_iterator
◆ FDynamicGraph()
| UE::Geometry::FDynamicGraph::FDynamicGraph |
( |
| ) |
|
|
inline |
◆ ~FDynamicGraph()
| virtual UE::Geometry::FDynamicGraph::~FDynamicGraph |
( |
| ) |
|
|
inlinevirtual |
◆ add_edge()
| int UE::Geometry::FDynamicGraph::add_edge |
( |
int |
A, |
|
|
int |
B, |
|
|
int |
GID |
|
) |
| |
|
inlineprotected |
◆ AllocateEdgeGroup()
| int UE::Geometry::FDynamicGraph::AllocateEdgeGroup |
( |
| ) |
|
|
inline |
◆ append_new_split_vertex()
| virtual int UE::Geometry::FDynamicGraph::append_new_split_vertex |
( |
int |
A, |
|
|
int |
B |
|
) |
| |
|
inlineprotectedvirtual |
◆ append_vertex_internal()
| int UE::Geometry::FDynamicGraph::append_vertex_internal |
( |
| ) |
|
|
inlineprotected |
◆ AppendEdge() [1/3]
| int UE::Geometry::FDynamicGraph::AppendEdge |
( |
const FEdge & |
E | ) |
|
|
inline |
◆ AppendEdge() [2/3]
| int UE::Geometry::FDynamicGraph::AppendEdge |
( |
const FIndex2i & |
ev, |
|
|
int |
GID = -1 |
|
) |
| |
|
inline |
◆ AppendEdge() [3/3]
| int UE::Geometry::FDynamicGraph::AppendEdge |
( |
int |
v0, |
|
|
int |
v1, |
|
|
int |
GID = -1 |
|
) |
| |
|
inline |
◆ CheckValidity()
This function checks that the graph is well-formed, ie all internal data structures are consistent
◆ CollapseEdge()
◆ debug_check_is_edge()
| void UE::Geometry::FDynamicGraph::debug_check_is_edge |
( |
int |
E | ) |
const |
|
inlineprotected |
◆ debug_check_is_vertex()
| void UE::Geometry::FDynamicGraph::debug_check_is_vertex |
( |
int |
V | ) |
const |
|
inlineprotected |
◆ edge_has_v()
| bool UE::Geometry::FDynamicGraph::edge_has_v |
( |
int |
EID, |
|
|
int |
VID |
|
) |
| const |
|
inlineprotected |
◆ edge_other_v()
| int UE::Geometry::FDynamicGraph::edge_other_v |
( |
int |
EID, |
|
|
int |
VID |
|
) |
| const |
|
inlineprotected |
◆ EdgeCount()
| int UE::Geometry::FDynamicGraph::EdgeCount |
( |
| ) |
const |
|
inline |
◆ EdgeIndices()
◆ Edges()
◆ FindEdge()
| int UE::Geometry::FDynamicGraph::FindEdge |
( |
int |
VA, |
|
|
int |
VB |
|
) |
| const |
|
inline |
◆ GetEdge()
| FEdge UE::Geometry::FDynamicGraph::GetEdge |
( |
int |
EID | ) |
const |
|
inline |
◆ GetEdgeGroup()
| int UE::Geometry::FDynamicGraph::GetEdgeGroup |
( |
int |
EID | ) |
const |
|
inline |
◆ GetEdgeV()
| FIndex2i UE::Geometry::FDynamicGraph::GetEdgeV |
( |
int |
EID | ) |
const |
|
inline |
◆ GetMaxVtxEdgeCount()
| int UE::Geometry::FDynamicGraph::GetMaxVtxEdgeCount |
( |
| ) |
const |
|
inline |
◆ GetVtxEdgeCount()
| int UE::Geometry::FDynamicGraph::GetVtxEdgeCount |
( |
int |
VID | ) |
const |
|
inline |
◆ insert_vertex_internal()
| bool UE::Geometry::FDynamicGraph::insert_vertex_internal |
( |
int32 |
Vid | ) |
|
|
inlineprotected |
◆ InvalidEdge3()
| static FEdge UE::Geometry::FDynamicGraph::InvalidEdge3 |
( |
| ) |
|
|
inlinestatic |
◆ InvalidEdgeV()
◆ IsBoundaryVertex()
| bool UE::Geometry::FDynamicGraph::IsBoundaryVertex |
( |
int |
VID | ) |
const |
|
inline |
◆ IsCompact()
| bool UE::Geometry::FDynamicGraph::IsCompact |
( |
| ) |
const |
|
inline |
◆ IsCompactV()
| bool UE::Geometry::FDynamicGraph::IsCompactV |
( |
| ) |
const |
|
inline |
◆ IsEdge()
| bool UE::Geometry::FDynamicGraph::IsEdge |
( |
int |
EID | ) |
const |
|
inline |
◆ IsJunctionVertex()
| bool UE::Geometry::FDynamicGraph::IsJunctionVertex |
( |
int |
VID | ) |
const |
|
inline |
◆ IsRegularVertex()
| bool UE::Geometry::FDynamicGraph::IsRegularVertex |
( |
int |
VID | ) |
const |
|
inline |
◆ IsVertex()
| bool UE::Geometry::FDynamicGraph::IsVertex |
( |
int |
VID | ) |
const |
|
inline |
◆ MaxEdgeID()
| int UE::Geometry::FDynamicGraph::MaxEdgeID |
( |
| ) |
const |
|
inline |
◆ MaxGroupID()
| int UE::Geometry::FDynamicGraph::MaxGroupID |
( |
| ) |
const |
|
inline |
◆ MaxVertexID()
| int UE::Geometry::FDynamicGraph::MaxVertexID |
( |
| ) |
const |
|
inline |
◆ RemoveEdge()
| EMeshResult UE::Geometry::FDynamicGraph::RemoveEdge |
( |
int |
EID, |
|
|
bool |
bRemoveIsolatedVertices |
|
) |
| |
|
inline |
◆ RemoveVertex()
| EMeshResult UE::Geometry::FDynamicGraph::RemoveVertex |
( |
int |
VID, |
|
|
bool |
bRemoveIsolatedVertices |
|
) |
| |
|
inline |
◆ replace_edge_vertex()
| int UE::Geometry::FDynamicGraph::replace_edge_vertex |
( |
int |
EID, |
|
|
int |
VOld, |
|
|
int |
VNew |
|
) |
| |
|
inlineprotected |
◆ SetEdgeGroup()
| void UE::Geometry::FDynamicGraph::SetEdgeGroup |
( |
int |
EID, |
|
|
int |
GroupID |
|
) |
| |
|
inline |
◆ ShapeTimestamp()
| int UE::Geometry::FDynamicGraph::ShapeTimestamp |
( |
| ) |
const |
|
inline |
◆ SplitEdge() [1/2]
◆ SplitEdge() [2/2]
◆ SplitEdgeWithExistingVertex()
| EMeshResult UE::Geometry::FDynamicGraph::SplitEdgeWithExistingVertex |
( |
int |
EAB, |
|
|
int |
ExistingMidVert, |
|
|
FEdgeSplitInfo & |
Split |
|
) |
| |
|
inline |
◆ subclass_validity_checks()
◆ Timestamp()
| int UE::Geometry::FDynamicGraph::Timestamp |
( |
| ) |
const |
|
inline |
◆ updateTimeStamp()
| void UE::Geometry::FDynamicGraph::updateTimeStamp |
( |
bool |
bShapeChange | ) |
|
|
inlineprotected |
◆ VertexCount()
| int UE::Geometry::FDynamicGraph::VertexCount |
( |
| ) |
const |
|
inline |
◆ VertexIndices()
◆ VtxEdgesItr()
Enumerate edge ids connected to vertex (i.e. edge one-ring)
◆ VtxVerticesItr()
Enumerate "other" vertices of edges connected to vertex (i.e. vertex one-ring)
◆ DuplicateEdgeID
| constexpr int UE::Geometry::FDynamicGraph::DuplicateEdgeID = -2 |
|
staticconstexpr |
◆ edges
◆ edges_refcount
◆ InvalidID
| constexpr int UE::Geometry::FDynamicGraph::InvalidID = IndexConstants::InvalidID |
|
staticconstexpr |
◆ max_group_id
| int UE::Geometry::FDynamicGraph::max_group_id = 0 |
|
protected |
◆ shape_timestamp
| int UE::Geometry::FDynamicGraph::shape_timestamp = 0 |
|
protected |
◆ timestamp
| int UE::Geometry::FDynamicGraph::timestamp = 0 |
|
protected |
◆ vertex_edges
◆ vertices_refcount
The documentation for this class was generated from the following file: