1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#pragma once
#ifndef EXTRACT_GHKM_SUBGRAPH_H_
#define EXTRACT_GHKM_SUBGRAPH_H_
#include "Node.h"
#include <set>
#include <vector>
namespace Moses {
namespace GHKM {
class Node;
class Subgraph
{
public:
Subgraph(const Node *root)
: m_root(root)
, m_depth(0)
, m_size(root->GetType() == TREE ? 1 : 0)
, m_nodeCount(1) {}
Subgraph(const Node *root, const std::set<const Node *> &leaves)
: m_root(root)
, m_leaves(leaves)
, m_depth(-1)
, m_size(-1)
, m_nodeCount(-1)
{
m_depth = CalcDepth(m_root);
m_size = CalcSize(m_root);
m_nodeCount = CountNodes(m_root);
}
const Node *GetRoot() const { return m_root; }
const std::set<const Node *> &GetLeaves() const { return m_leaves; }
int GetDepth() const { return m_depth; }
int GetSize() const { return m_size; }
int GetNodeCount() const { return m_nodeCount; }
bool IsTrivial() const { return m_leaves.empty(); }
void GetTargetLeaves(std::vector<const Node *> &) const;
private:
void GetTargetLeaves(const Node *, std::vector<const Node *> &) const;
int CalcDepth(const Node *) const;
int CalcSize(const Node *) const;
int CountNodes(const Node *) const;
const Node *m_root;
std::set<const Node *> m_leaves;
int m_depth;
int m_size;
int m_nodeCount;
};
} // namespace GHKM
} // namespace Moses
#endif
|
