|
| int | AppendVertex () |
| |
| | 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 |
| |
Implementation of DGraph that has no dimensionality, ie no data stored for vertices besides indices.