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 | |
DirectedGraph () | |
Null constructor. | |
~DirectedGraph () | |
Default constructor. | |
DirectedGraph (std::vector< DirectedCell > &) | |
Class Constructor: Initialises the DirectedGraph with the cells. | |
void | add_cell (DirectedCell &) |
Appends a cell to the end of the graph. | |
void | remove_cell (std::size_t) |
Removes cell from a given position. | |
bool | test_graph () |
Test if graph has duplicate edges or unordered cells. | |
void | randomise () |
Randomise order of cells in graph. | |
void | order () |
Order cells in graph by the number of edges in each cell. | |
void | coarsen () |
Coarsen the graph by merging cells. | |
NodeArray | graph_to_array () |
Returns the cell-node array the graph corresponds to. | |
std::string | get_partition () |
Returns list of fine cells that each coarse cell consists of. | |
void | plotfile (std::ofstream *, std::vector< Eigen::VectorXd > &) |
Outputs to a .dat file for gnuplot to read. | |
Public Attributes | |
std::vector< DirectedCell > | G |
Vector of cells that form the graph. | |