#include "angel_types.hpp"
#include "angel_io.hpp"
#include "xaifBooster/algorithms/CrossCountryInterface/inc/AwarenessLevel.hpp"
Go to the source code of this file.
Namespaces | |
namespace | angel |
Classes | |
struct | angel::edge_vertex_elim_t |
class | angel::elimination_history_t< Ad_graph_t, El_spec_t > |
Elimination history. More... | |
Typedefs | |
typedef vector < edge_vertex_elim_t > | angel::edge_vertex_elim_seq_t |
sequences of edges as nodes from line graph | |
typedef elimination_history_t < c_graph_t, c_graph_t::vertex_t > | angel::vertex_elimination_history_t |
Vertex elimination history for LSA usage. | |
typedef elimination_history_t < c_graph_t, edge_ij_elim_t > | angel::edge_elimination_history_t |
Edge elimination history for LSA usage. | |
typedef elimination_history_t < line_graph_t, triplet_t > | angel::face_elimination_history_t |
Face elimination history for LSA usage. | |
Functions | |
int | angel::vertex_elimination (c_graph_t::vertex_t v, c_graph_t &cg) |
int | angel::vertex_elimination (int j, c_graph_t &cg) |
int | angel::front_edge_elimination (c_graph_t::edge_t e, c_graph_t &cg) |
int | angel::front_edge_elimination (c_graph_t::vertex_t i, c_graph_t::vertex_t j, c_graph_t &cg) |
int | angel::front_edge_elimination (int i, int j, c_graph_t &cg) |
int | angel::back_edge_elimination (c_graph_t::edge_t e, c_graph_t &cg) |
int | angel::back_edge_elimination (c_graph_t::vertex_t i, c_graph_t::vertex_t j, c_graph_t &cg) |
int | angel::back_edge_elimination (int i, int j, c_graph_t &cg) |
int | angel::edge_elimination (c_graph_t::edge_t e, bool front, c_graph_t &cg) |
int | angel::edge_elimination (edge_bool_t e, c_graph_t &cg) |
int | angel::edge_elimination (c_graph_t::vertex_t i, c_graph_t::vertex_t j, bool front, c_graph_t &cg) |
int | angel::edge_elimination (int i, int j, bool front, c_graph_t &cg) |
int | angel::edge_elimination (edge_ij_elim_t ee, c_graph_t &cg) |
Edge elimination specified by ee . | |
int | angel::vertex_elimination (const vector< int > &seq, c_graph_t &cg) |
int | angel::edge_elimination (const edge_elim_seq_t &seq, c_graph_t &cg) |
int | angel::edge_elimination (const edge_pair_elim_seq_t &seq, c_graph_t &cg) |
int | angel::edge_elimination (const edge_ij_elim_seq_t &seq, 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::edge_elimination (int i, int j, bool front, line_graph_t &lg) |
int | angel::edge_elimination (line_graph_t::edge_t vij, bool front, line_graph_t &lg) |
Front elimination of edge vij from line graph lg if front=true otherwise back eliminination. | |
int | angel::edge_elimination (const edge_vertex_elim_seq_t &seq, line_graph_t &lg) |
Eliminate sequence seq of edges from line graph lg . | |
int | angel::face_elimination (line_graph_t::face_t f, int kr, line_graph_t &lg, accu_graph_t &ac) |
int | angel::face_elimination (line_graph_t::face_t f, int kr, line_graph_t &lg) |
int | angel::face_elimination (line_graph_t::face_t f, line_graph_t &lg) |
int | angel::face_elimination (int i, int j, line_graph_t &lg) |
int | angel::face_elimination (int i, int j, int kr, line_graph_t &lg) |
int | angel::face_elimination (int i, int j, int kr, line_graph_t &lg, accu_graph_t &ac) |
int | angel::face_elimination (triplet_t &t, line_graph_t &lg) |
int | angel::face_elimination (triplet_t &t, line_graph_t &lg, accu_graph_t &ac) |
int | angel::was_non_trivial_elimination (int i, int j, int k, const line_graph_t &lg) |
int | angel::was_non_trivial_elimination (line_graph_t::face_t f, int k, const line_graph_t &lg) |
int | angel::eliminate (c_graph_t::vertex_t v, c_graph_t &cg) |
Overloaded elimination for templates, here vertex elimination in c-graph. | |
int | angel::eliminate (int j, c_graph_t &cg) |
Overloaded elimination for templates, here vertex elimination in c-graph. | |
int | angel::eliminate (int j, line_graph_t &lg) |
Overloaded elimination for templates, here vertex elimination in line graph. | |
int | angel::eliminate (edge_bool_t e, c_graph_t &cg) |
Overloaded elimination for templates, here vertex elimination in c-graph. | |
int | angel::eliminate (edge_ij_elim_t ee, c_graph_t &cg) |
Overloaded elimination for templates, here vertex elimination in c-graph. | |
int | angel::eliminate (line_graph_t::face_t f, line_graph_t &lg) |
int | angel::eliminate (triplet_t &t, line_graph_t &lg) |
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, vector< c_graph_t::edge_t > &ev) |
Returns a set of edges that can be eliminated from c-graph cg . | |
int | angel::front_eliminatable_edges (const c_graph_t &cg, vector< c_graph_t::edge_t > &ev) |
Returns a set of edges that can be front eliminated from c-graph cg . | |
int | angel::back_eliminatable_edges (const c_graph_t &cg, vector< c_graph_t::edge_t > &ev) |
Returns a set of edges that can be back eliminated from c-graph cg . | |
int | angel::eliminatable_edges (const c_graph_t &cg, vector< edge_bool_t > &ev) |
Returns a set of edges that can be eliminated from c-graph cg and how. | |
int | angel::eliminatable_edges (const c_graph_t &cg, vector< edge_ij_elim_t > &ev) |
Returns a set of edges that can be eliminated from c-graph cg and how. | |
unsigned int | angel::eliminatable_edges (const c_graph_t &cg, vector< EdgeElim > &ev) |
Returns a set of edges that can be eliminated from c-graph cg . | |
int | angel::eliminatable_faces (const line_graph_t &lg, vector< line_graph_t::face_t > &fv) |
Returns a set of faces that can be eliminated from line graph lg . | |
int | angel::eliminatable_triplets (const line_graph_t &lg, vector< triplet_t > &tv) |
Returns a set of eliminatable faces as triplets tv from line graph lg . | |
int | angel::eliminatable_objects (const c_graph_t &cg, vector< c_graph_t::vertex_t > &vv) |
Synonym of eliminatable_vertices for usage in templates. | |
int | angel::eliminatable_objects (const c_graph_t &cg, vector< c_graph_t::edge_t > &ev) |
Synonym of eliminatable_edges for usage in templates. | |
int | angel::eliminatable_objects (const c_graph_t &cg, vector< edge_bool_t > &ev) |
Synonym of eliminatable_edges for usage in templates. | |
int | angel::eliminatable_objects (const c_graph_t &cg, vector< edge_ij_elim_t > &ev) |
Synonym of eliminatable_edges for usage in templates. | |
int | angel::eliminatable_objects (const line_graph_t &lg, vector< line_graph_t::face_t > &fv) |
Synonym of eliminatable_faces for usage in templates. | |
int | angel::eliminatable_objects (const line_graph_t &lg, vector< triplet_t > &tv) |
Synonym of eliminatable_triplets for usage in templates. | |
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 ¤tElimSeq, refillDependenceMap_t &refillDependences) |
unsigned int | angel::front_elim (c_graph_t::edge_t e, c_graph_t &angelLCG, const elimSeq_cost_t ¤tElimSeq, refillDependenceMap_t &refillDependences) |
unsigned int | angel::back_elim (c_graph_t::edge_t e, c_graph_t &angelLCG, const elimSeq_cost_t ¤tElimSeq, 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) |