7 #ifndef GRAPHGEN_FOREST2DAG_H_
8 #define GRAPHGEN_FOREST2DAG_H_
12 #include <unordered_map>
18 std::unordered_map<BinaryDrag<conact>::node*, std::string>
ps_;
19 std::unordered_map<std::string, BinaryDrag<conact>::node*>
sp_;
A BinaryDrag is the GRAPHGEN implementation of a Binary Directed Rooted Acyclic Graph (DRAG in short)
std::unordered_map< BinaryDrag< conact >::node *, std::string > ps_
Forest2Dag(LineForestHandler &f)
std::unordered_map< std::string, BinaryDrag< conact >::node * > sp_
std::string Tree2String(BinaryDrag< conact >::node *n)
void FindAndLink(BinaryDrag< conact >::node *n)
Generates all the forests needed to handle one line of the image.