doc/ogdf/_minimum_cut_module_8h_source.html

#pragma once


#include <ogdf/basic/Graph_d.h>


namespace ogdf {


template<typename T>


class MinimumCutModule {

public:

    virtual ~MinimumCutModule() { }


    virtual T call(const Graph& G) = 0;


    virtual T call(const Graph& G, const EdgeArray<T>& weights) = 0;


    virtual const ArrayBuffer<edge>& edges() = 0;


    virtual const ArrayBuffer<node>& nodes() = 0;


    virtual T value() const = 0;

};


}

Graph_d.h
Pure declaration header, find template implementation in Graph.h.

ogdf::ArrayBuffer
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
Definition ArrayBuffer.h:56

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::MinimumCutModule
Serves as an interface for various methods to compute minimum cuts with or without edge weights.
Definition MinimumCutModule.h:45

ogdf::MinimumCutModule::value
virtual T value() const =0
Returns the value of the last minimum cut computation.

ogdf::MinimumCutModule::call
virtual T call(const Graph &G, const EdgeArray< T > &weights)=0
Computes the minimum cut of G with edge weights weights.

ogdf::MinimumCutModule::nodes
virtual const ArrayBuffer< node > & nodes()=0
Returns a list of nodes belonging to one side of the bipartition.

ogdf::MinimumCutModule::edges
virtual const ArrayBuffer< edge > & edges()=0
Returns the edges defining the computed mincut.

ogdf::MinimumCutModule::~MinimumCutModule
virtual ~MinimumCutModule()
Do nothing on destruction.
Definition MinimumCutModule.h:48

ogdf::MinimumCutModule::call
virtual T call(const Graph &G)=0
Computes the minimum cut of G.

getDoubleFactoredZeroAdjustedMerger
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
Definition multilevelmixer.cpp:36

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