Version: 1.0
src
GRAPHGEN
tree2dag_identities.h
Go to the documentation of this file.
1
// Copyright (c) 2020, the GRAPHGEN contributors, as
2
// shown by the AUTHORS file. All rights reserved.
3
//
4
// Use of this source code is governed by a BSD-style
5
// license that can be found in the LICENSE file.
6
7
#ifndef GRAPHGEN_TREE2DAG_IDENTITIES_H_
8
#define GRAPHGEN_TREE2DAG_IDENTITIES_H_
9
10
#include "
conact_tree.h
"
11
12
void
FindAndLinkIdentiesRec
(
BinaryDrag<conact>::node
* n1,
BinaryDrag<conact>::node
* n2);
13
//void Tree2DagUsingIdentitiesRec(BinaryDrag<conact>::node *n, BinaryDrag<conact>& t);
14
15
// Converts a tree into dag considering only equal subtrees
16
void
Tree2DagUsingIdentities
(
BinaryDrag<conact>
& t);
17
18
#endif
//!GRAPHGEN_TREE2DAG_IDENTITIES_H_
BinaryDrag
A BinaryDrag is the GRAPHGEN implementation of a Binary Directed Rooted Acyclic Graph (DRAG in short)
Definition:
drag.h:28
conact_tree.h
FindAndLinkIdentiesRec
void FindAndLinkIdentiesRec(BinaryDrag< conact >::node *n1, BinaryDrag< conact >::node *n2)
Definition:
tree2dag_identities.cpp:32
Tree2DagUsingIdentities
void Tree2DagUsingIdentities(BinaryDrag< conact > &t)
Definition:
tree2dag_identities.cpp:58
Generated by
1.9.1