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