| FDynamicGraph
|
Module |
|
Header |
/Engine/Plugins/Experimental/GeometryProcessing/Source/GeometricObjects/Public/Curve/DynamicGraph.h |
Include |
#include "Curve/DynamicGraph.h" |
class FDynamicGraph
Name | Description | ||
---|---|---|---|
|
TDynamicVector<... |
edges |
|
|
edges_refcount |
||
|
int |
max_group_id |
|
|
int |
shape_timestamp |
|
|
int |
timestamp |
|
|
vertex_edges |
||
|
vertices_refcount |
Name | Description | |
---|---|---|
|
FDynamicGraph() |
Name | Description | |
---|---|---|
|
~FDynamicGraph() |
Name | Description | ||
---|---|---|---|
|
int |
add_edge ( |
|
|
int |
AllocateEdgeGroup() |
|
|
int |
append_new_split_vertex ( |
|
|
int |
append_vertex_internal() |
|
|
int |
AppendEdge ( |
|
|
int |
AppendEdge ( |
|
|
int |
AppendEdge ( |
|
|
CheckValidity ( |
This function checks that the graph is well-formed, ie all internal data structures are consistent |
|
|
CollapseEdge ( |
||
|
debug_check_is_edge ( |
||
|
debug_check_is_vertex ( |
||
|
edge_has_v ( |
||
|
int |
edge_other_v ( |
|
|
int |
EdgeCount() |
|
|
edge_iterato... |
EdgeIndices() |
|
|
value_iterat... |
Edges() |
Enumerate edges. |
|
int |
FindEdge ( |
|
|
GetEdge ( |
||
|
int |
GetEdgeGroup ( |
|
|
GetEdgeV ( |
||
|
int |
GetMaxVtxEdgeCount() |
|
|
int |
GetVtxEdgeCount ( |
|
|
InvalidEdge3() |
||
|
InvalidEdgeV() |
||
|
IsBoundaryVertex ( |
||
|
IsCompact() |
||
|
IsCompactV() |
||
|
IsEdge ( |
||
|
IsJunctionVertex ( |
||
|
IsRegularVertex ( |
||
|
IsVertex ( |
||
|
int |
MaxEdgeID() |
|
|
int |
MaxGroupID() |
|
|
int |
MaxVertexID() |
These values are (max_used+1), ie so an iteration should be < MaxVertexID, not <= |
|
RemoveEdge ( |
||
|
RemoveVertex ( |
||
|
int |
replace_edge_vertex ( |
|
|
SetEdgeGroup ( |
||
|
int |
ShapeTimestamp() |
|
|
SplitEdge ( |
||
|
SplitEdge ( |
||
|
SplitEdgeWithExistingVertex ( |
||
|
subclass_validity_checks |
||
|
int |
Timestamp() |
|
|
updateTimeStamp ( |
||
|
int |
VertexCount() |
|
|
vertex_itera... |
VertexIndices() |
|
|
FSmallListSe... |
VtxEdgesItr ( |
Enumerate edge ids connected to vertex (i.e. edge one-ring) |
|
FSmallListSe... |
VtxVerticesItr ( |
Enumerate "other" vertices of edges connected to vertex (i.e. vertex one-ring) |
Name |
Description |
|
---|---|---|
|
FEdge |
|
|
FEdgeCollapseInfo |
|
|
FEdgeSplitInfo |
Name |
Description |
---|---|
edge_iterator |
|
value_iteration |
|
vertex_iterator |
Iterators The functions vertices() / triangles() / edges() are provided so you can do: for ( int EID : edges() ) { ... } and other related begin() / end() idioms |
Name |
Description |
---|---|
DuplicateEdgeID |
|
InvalidID |