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 | |
DirectedEdge () | |
Null constructor. | |
~DirectedEdge () | |
Destructor. | |
DirectedEdge (size_t, size_t) | |
Class Constructor: Initialises the edge with the two nodes that form the edge. | |
DirectedEdge | anti_edge () |
Returns the edge consisting of the same nodes, pointing in the opposite direction. | |
Public Attributes | |
std::size_t | a |
Node number of the edge tail. | |
std::size_t | b |
Node number of the edge head. | |
The DirectedEdge class is the defining element of a DirectedCell. It takes its two end points as parameters and contains functions to assist with comparing edges.