doc/ogdf/_core_edge_module_8h_source.html

#pragma once


#include <ogdf/basic/EdgeArray.h>


namespace ogdf {

namespace steiner_tree {

namespace goemans {


template<typename T>


class CoreEdgeModule {

public:

    virtual void call(const Graph& graph, const List<node>& terminals,

            EdgeArray<bool>& isInTree) const = 0;

};


}

}

}

EdgeArray.h
Declaration and implementation of EdgeArray class.

ogdf::EdgeArray
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125

ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521

ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435

ogdf::steiner_tree::goemans::CoreEdgeModule
Interface for core edge finder algorithms.
Definition CoreEdgeModule.h:42

ogdf::steiner_tree::goemans::CoreEdgeModule::call
virtual void call(const Graph &graph, const List< node > &terminals, EdgeArray< bool > &isInTree) const =0
Compute a set of core edges.

ogdf
The namespace for all OGDF objects.
Definition AugmentationModule.h:36