DirectedCell Class Reference

#include <DirectedGraph.hpp>

Public Member Functions
	DirectedCell ()
	Null Constructor.
	DirectedCell (std::size_t)
	Constructor.
	~DirectedCell ()
	Destructor.
	DirectedCell (std::vector< DirectedEdge > &, std::size_t)
	Class Constructor: Initialises the cell with a vector of edges and the cell ID.
void	add_edge (DirectedEdge &)
	Method to append an edge to the end of the cell.
void	remove_edge (std::size_t)
	Remove edge at a given position.
void	append_cell (DirectedCell &)
bool	check_nodes ()
	Checks for repeated or lone nodes.
bool	is_ordered ()
	Tests if the edges of the cell are ordered.
void	remove_duplicate_edges ()
	Method to remove all edge - antiedge pairs.
std::vector< DirectedEdge >	order_edges ()
	Orders the cell edges - returns vector of edges to be removed.
bool	has_edge (DirectedEdge)
	Tests if cell has an edge.
void	print ()
	Prints all the edges of the cell.

Public Attributes
std::vector< DirectedEdge >	T
	The edges the cell consists of.
std::vector< std::size_t >	part
	The cell ID's of the cell's that have formed this cell.

Detailed Description

The DirectedCell class is the defining element of a DirectedGraph. It is defined by a vector of DirectedEdge's, and a vector of unsigned int's describing the fine cells that make up the cell upon coarsening. The class contains functions related to cell manipulation.

---

The documentation for this class was generated from the following files:

• Schemes/MeshCoarsen/DirectedGraph.hpp
• Schemes/MeshCoarsen/DirectedGraph.cpp