Version: 1.0
Functions
drag2optimal.cpp File Reference
#include "drag2optimal.h"
#include <iostream>
#include <map>
#include <vector>
#include "drag_statistics.h"

Go to the source code of this file.

Functions

void FindAndLinkIdentiesDagRec (BinaryDrag< conact >::node *n1, BinaryDrag< conact >::node *n2, std::map< BinaryDrag< conact >::node *, bool > &visited_fl)
 
void Dag2DagUsingIdentiesRec (BinaryDrag< conact >::node *n, BinaryDrag< conact > &t, std::map< BinaryDrag< conact >::node *, bool > &visited_n)
 
void Dag2DagUsingIdenties (BinaryDrag< conact > &t)
 
void FindAndLinkEquivalencesDagRec (BinaryDrag< conact >::node *n1, BinaryDrag< conact >::node *n2, std::map< BinaryDrag< conact >::node *, bool > &visited_fl)
 
void Dag2DagUsingEquivalencesRec (BinaryDrag< conact >::node *n, BinaryDrag< conact > &t, std::map< BinaryDrag< conact >::node *, bool > &visited_n, bool considering_leaves)
 
void Dag2DagUsingEquivalences (BinaryDrag< conact > &t, bool considering_leaves)
 
void Dag2OptimalDagRec (BinaryDrag< conact > &t, BinaryDrag< conact >::node *n, BinaryDrag< conact > &best_tree, size_t &best_nodes, size_t &best_leaves, std::map< const BinaryDrag< conact >::node *, bool > &visited_n, uint &counter)
 
void Dag2OptimalDag (BinaryDrag< conact > &t)
 

Function Documentation

◆ Dag2DagUsingEquivalences()

void Dag2DagUsingEquivalences ( BinaryDrag< conact > &  t,
bool  considering_leaves 
)

Definition at line 109 of file drag2optimal.cpp.

◆ Dag2DagUsingEquivalencesRec()

void Dag2DagUsingEquivalencesRec ( BinaryDrag< conact >::node *  n,
BinaryDrag< conact > &  t,
std::map< BinaryDrag< conact >::node *, bool > &  visited_n,
bool  considering_leaves 
)

Definition at line 92 of file drag2optimal.cpp.

◆ Dag2DagUsingIdenties()

void Dag2DagUsingIdenties ( BinaryDrag< conact > &  t)

Definition at line 69 of file drag2optimal.cpp.

◆ Dag2DagUsingIdentiesRec()

void Dag2DagUsingIdentiesRec ( BinaryDrag< conact >::node *  n,
BinaryDrag< conact > &  t,
std::map< BinaryDrag< conact >::node *, bool > &  visited_n 
)

Definition at line 55 of file drag2optimal.cpp.

◆ Dag2OptimalDag()

void Dag2OptimalDag ( BinaryDrag< conact > &  t)

Definition at line 172 of file drag2optimal.cpp.

◆ Dag2OptimalDagRec()

void Dag2OptimalDagRec ( BinaryDrag< conact > &  t,
BinaryDrag< conact >::node *  n,
BinaryDrag< conact > &  best_tree,
size_t &  best_nodes,
size_t &  best_leaves,
std::map< const BinaryDrag< conact >::node *, bool > &  visited_n,
uint counter 
)

Definition at line 115 of file drag2optimal.cpp.

◆ FindAndLinkEquivalencesDagRec()

void FindAndLinkEquivalencesDagRec ( BinaryDrag< conact >::node *  n1,
BinaryDrag< conact >::node *  n2,
std::map< BinaryDrag< conact >::node *, bool > &  visited_fl 
)

Definition at line 74 of file drag2optimal.cpp.

◆ FindAndLinkIdentiesDagRec()

void FindAndLinkIdentiesDagRec ( BinaryDrag< conact >::node *  n1,
BinaryDrag< conact >::node *  n2,
std::map< BinaryDrag< conact >::node *, bool > &  visited_fl 
)

Definition at line 37 of file drag2optimal.cpp.