eliminations.cpp File Reference

#include "angel/include/eliminations.hpp"
#include "angel/include/angel_tools.hpp"
#include "angel/include/angel_io.hpp"

Include dependency graph for eliminations.cpp:

Go to the source code of this file.

Namespaces
namespace	angel
Functions
int	angel::vertex_elimination (c_graph_t::vertex_t v, c_graph_t &cg)
int	angel::front_edge_elimination (c_graph_t::edge_t e, c_graph_t &cg)
int	angel::back_edge_elimination (c_graph_t::edge_t e, c_graph_t &cg)
int	angel::vertex_elimination (int j, line_graph_t &lg)
int	angel::front_edge_elimination (int i, int j, line_graph_t &lg)
int	angel::front_edge_elimination (line_graph_t::edge_t vij, line_graph_t &lg)
int	angel::back_edge_elimination (int i, int j, line_graph_t &lg)
int	angel::back_edge_elimination (line_graph_t::edge_t vij, line_graph_t &lg)
int	angel::face_elimination (line_graph_t::face_t f, int kr, line_graph_t &lg, accu_graph_t &ac)
int	angel::eliminatable_vertices (const c_graph_t &cg, vector< c_graph_t::vertex_t > &vv)
	Returns a set of vertices that can be eliminated from c-graph cg.
int	angel::semi_eliminatable_vertices (const c_graph_t &cg, vector< c_graph_t::vertex_t > &vv)
	Returns a set of vertices that can be eliminated from c-graph cg by edge elimination.
int	angel::eliminatable_edges (const c_graph_t &cg, std::vector< c_graph_t::edge_t > &ev)
int	angel::front_eliminatable_edges (const c_graph_t &cg, std::vector< c_graph_t::edge_t > &ev)
int	angel::back_eliminatable_edges (const c_graph_t &cg, std::vector< c_graph_t::edge_t > &ev)
int	angel::eliminatable_edges (const c_graph_t &cg, std::vector< edge_bool_t > &ev)
int	angel::eliminatable_edges (const c_graph_t &cg, std::vector< edge_ij_elim_t > &ev)
unsigned int	angel::eliminatable_edges (const c_graph_t &cg, std::vector< EdgeElim > &ev)
int	angel::eliminatable_faces (const line_graph_t &lg, std::vector< line_graph_t::face_t > &fv)
bool	angel::convert_elimination_sequence (const vector< c_graph_t::vertex_t > &vv, const c_graph_t &cg, vector< edge_ij_elim_t > &ev)
	Converts vertex elimination sequence into (mixed) edge elimination sequence.
bool	angel::convert_elimination_sequence (const vector< edge_ij_elim_t > &ev, const line_graph_t &lg, vector< triplet_t > &tv)
	Converts (mixed) edge elimination sequence into face elimination sequence.
EdgeRefType_E	angel::getRefType (const c_graph_t::edge_t e, const c_graph_t &angelLCG, const list< EdgeRef_t > &edge_ref_list)
const xaifBoosterCrossCountryInterface::LinearizedComputationalGraphEdge *	angel::getLCG_p (const c_graph_t::edge_t e, const c_graph_t &angelLCG, const list< EdgeRef_t > &edge_ref_list)
xaifBoosterCrossCountryInterface::JacobianAccumulationExpressionVertex *	angel::getJAE_p (const c_graph_t::edge_t e, const c_graph_t &angelLCG, const list< EdgeRef_t > &edge_ref_list)
void	angel::setJaevRef (const c_graph_t::edge_t e, xaifBoosterCrossCountryInterface::JacobianAccumulationExpressionVertex &jaev, const c_graph_t &angelLCG, const list< EdgeRef_t > &edge_ref_list)
void	angel::removeRef (const c_graph_t::edge_t e, const c_graph_t &angelLCG, list< EdgeRef_t > &edge_ref_list)
unsigned int	angel::multiply_edge_pair_directly (const c_graph_t::edge_t e1, const c_graph_t::edge_t e2, c_graph_t &angelLCG, list< EdgeRef_t > &edge_ref_list, xaifBoosterCrossCountryInterface::JacobianAccumulationExpressionList &jae_list)
unsigned int	angel::front_eliminate_edge_directly (c_graph_t::edge_t e, c_graph_t &angelLCG, list< EdgeRef_t > &edge_ref_list, xaifBoosterCrossCountryInterface::JacobianAccumulationExpressionList &jae_list)
unsigned int	angel::back_eliminate_edge_directly (c_graph_t::edge_t e, c_graph_t &angelLCG, list< EdgeRef_t > &edge_ref_list, xaifBoosterCrossCountryInterface::JacobianAccumulationExpressionList &jae_list)
unsigned int	angel::pair_elim (c_graph_t::edge_t e1, c_graph_t::edge_t e2, c_graph_t &angelLCG, const elimSeq_cost_t &currentElimSeq, refillDependenceMap_t &refillDependences)
unsigned int	angel::front_elim (c_graph_t::edge_t e, c_graph_t &angelLCG, const elimSeq_cost_t &currentElimSeq, refillDependenceMap_t &refillDependences)
unsigned int	angel::back_elim (c_graph_t::edge_t e, c_graph_t &angelLCG, const elimSeq_cost_t &currentElimSeq, refillDependenceMap_t &refillDependences)
unsigned int	angel::pairElim_noJAE (c_graph_t::edge_t e1, c_graph_t::edge_t e2, c_graph_t &angelLCG, const transformationSeq_cost_t *currentTransformationSequence, refillDependenceMap_t &refillDependences)
unsigned int	angel::frontEdgeElimination_noJAE (c_graph_t::edge_t e, c_graph_t &angelLCG, const transformationSeq_cost_t *currentTransformationSequence, refillDependenceMap_t &refillDependences)
unsigned int	angel::backEdgeElimination_noJAE (c_graph_t::edge_t e, c_graph_t &angelLCG, const transformationSeq_cost_t *currentTransformationSequence, refillDependenceMap_t &refillDependences)

---