|
HArD::Core2D
Hybrid Arbitrary Degree::Core 2D - Library to implement 2D schemes with edge and cell polynomials as unknowns
|
#include <DirectedGraph.hpp>
Public Member Functions | |
| DirectedCell () | |
| Null Constructor. More... | |
| DirectedCell (std::size_t) | |
| Constructor. More... | |
| ~DirectedCell () | |
| Destructor. More... | |
| DirectedCell (std::vector< DirectedEdge > &, std::size_t) | |
| Class Constructor: Initialises the cell with a vector of edges and the cell ID. More... | |
| void | add_edge (DirectedEdge &) |
| Method to append an edge to the end of the cell. More... | |
| void | remove_edge (std::size_t) |
| Remove edge at a given position. More... | |
| void | append_cell (DirectedCell &) |
| bool | check_nodes () |
| Checks for repeated or lone nodes. More... | |
| bool | is_ordered () |
| Tests if the edges of the cell are ordered. More... | |
| void | remove_duplicate_edges () |
| Method to remove all edge - antiedge pairs. More... | |
| std::vector< DirectedEdge > | order_edges () |
| Orders the cell edges - returns vector of edges to be removed. More... | |
| bool | has_edge (DirectedEdge) |
| Tests if cell has an edge. More... | |
| void | print () |
| Prints all the edges of the cell. More... | |
Public Attributes | |
| std::vector< DirectedEdge > | T |
| The edges the cell consists of. More... | |
| std::vector< std::size_t > | part |
| The cell ID's of the cell's that have formed this cell. More... | |
The DirectedCell class is the defining element of a DirectedGraph. It is defined by a vector of DirectedEdge's, and a vector of unsigned int's describing the fine cells that make up the cell upon coarsening. The class contains functions related to cell manipulation.
1.9.1