#include "drag2optimal.h"
#include <iostream>
#include <map>
#include <vector>
#include "drag_statistics.h"
Go to the source code of this file.
|
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) |
|
◆ Dag2DagUsingEquivalences()
void Dag2DagUsingEquivalences |
( |
BinaryDrag< conact > & |
t, |
|
|
bool |
considering_leaves |
|
) |
| |
◆ Dag2DagUsingEquivalencesRec()
◆ Dag2DagUsingIdenties()
◆ Dag2DagUsingIdentiesRec()
◆ Dag2OptimalDag()
◆ Dag2OptimalDagRec()
◆ FindAndLinkEquivalencesDagRec()
◆ FindAndLinkIdentiesDagRec()