Full2ComponentGenerator.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraph.h>
 
namespace ogdf {
namespace steiner_tree {
 
template<typename T>
class Full2ComponentGenerator {
public:
    inline void call(const EdgeWeightedGraph<T>& G, const List<node>& terminals,
            const NodeArray<NodeArray<T>>& distance, const NodeArray<NodeArray<edge>>& pred,
            std::function<void(node, node, T)> generateFunction) const {
        for (ListConstIterator<node> it_u = terminals.begin(); it_u.valid(); ++it_u) {
            const node u = *it_u;
            for (ListConstIterator<node> it_v = it_u.succ(); it_v.valid(); ++it_v) {
                const node v = *it_v;
                if (pred[u][v]) {
                    generateFunction(u, v, distance[u][v]);
                }
            }
        }
    }
};
 
}
}