15 #ifndef PAAL_STEINER_COMPONENTS_HPP
16 #define PAAL_STEINER_COMPONENTS_HPP
39 m_original_id.push_back(m_components.size());
40 m_version.push_back(i);
42 m_components.push_back(component);
48 int size()
const {
return m_size; }
54 assert(
id >= 0 &&
id < m_size);
55 return m_components[m_original_id[id]];
69 m_original_id.clear();
74 std::vector<steiner_component<Vertex, Dist>> m_components;
76 std::vector<int> m_version;
77 std::vector<int> m_original_id;
84 #endif // PAAL_STEINER_COMPONENTS_HPP
Class represents k-components of Steiner Tree. Component is a subtree whose terminals coincide with l...
int count_terminals() const
const steiner_component< Vertex, Dist > & find(int id) const
void add(const steiner_component< Vertex, Dist > &component)
int find_version(int id) const