|
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 | |
| NodeArray () | |
| Null constructor. More... | |
| ~NodeArray () | |
| Default constructor. More... | |
| NodeArray (Array &) | |
| Class Constructor: Initialises the NodeArray with the cell-node array. More... | |
| bool | node_exists (std::size_t) |
| Test if a given node exists in the cell-node array. More... | |
| void | renum_nodes (std::size_t) |
| Subtracts one from all nodes greater than a given node. More... | |
| void | print (std::ofstream *, std::size_t width=6) |
| Prints the cell node array to an out file stream. More... | |
Public Attributes | |
| Array | A |
| The cell-node array. More... | |
The NodeArray class is generated from the directed graph, and combined with the vertex coordinates fully describes a mesh.
1.9.1