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