Exact computation of a maximum c-planar subgraph. More...

#include <ogdf/cluster/MaximumCPlanarSubgraph.h>

Inheritance diagram for ogdf::MaximumCPlanarSubgraph:

Public Types
using	MaxCPlanarMaster = cluster_planarity::MaxCPlanarMaster

using	NodePairs = List< NodePair >

Public Types inherited from ogdf::Module
enum	ReturnType { ReturnType::Feasible, ReturnType::Optimal, ReturnType::NoFeasibleSolution, ReturnType::TimeoutFeasible, ReturnType::TimeoutInfeasible, ReturnType::Error }
	The return type of a module. More...

Public Member Functions
	MaximumCPlanarSubgraph ()
	Construction. More...

	~MaximumCPlanarSubgraph ()

ReturnType	callAndConnect (const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges)
	Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph and also returns a set of edges that augments the subgraph to be completely connected. For pure c-planarity testing, the computation can be sped up by setting setCheckCPlanar(2). Then, in case G is not c-planar, the list of deleted edges does not need to correspond to a valid solution, it just indicates the result. More...

double	getHeurTime ()

double	getLPSolverTime ()

double	getLPTime ()

int	getNumBCs ()
	Returns number of generated LPs. More...

int	getNumCCons ()
	Returns number of connectivity constraints added during computation. More...

int	getNumKCons ()
	Returns number of Kuratowski constraints added during computation. More...

int	getNumLPs ()
	Returns number of optimized LPs (only LP-relaxations) More...

int	getNumSubSelected ()
	Returns number of subproblems selected by ABACUS. More...

int	getNumVars ()
	Returns number of global variables. Todo: Real number from ABACUS. More...

double	getSeparationTime ()

bool	getSolByHeuristic ()

double	getTotalTime ()

double	getTotalWTime ()

void	setBranchingGap (double d)

void	setCheckCPlanar (bool b)

void	setHeuristicBound (double d)

void	setHeuristicLevel (int i)

void	setHeuristicRuns (int i)

void	setLowerRounding (double d)

void	setNumAddVariables (int n)

void	setNumberOfKuraIterations (int i)

void	setNumberOfPermutations (int i)

void	setNumberOfSubDivisions (int i)

void	setNumberOfSupportGraphs (int i)

void	setPerturbation (bool b)

void	setPortaOutput (bool b)

void	setPricing (bool b)

void	setStrongConstraintViolation (double d)

void	setStrongVariableViolation (double d)

void	setTimeLimit (std::chrono::milliseconds milliSec)

void	setTimeLimit (string s)

void	setUpperRounding (double d)

bool &	useDefaultCutPool ()
	Use default abacus master cut pool or dedicated connectivity and kuratowski cut pools. More...

void	writeFeasible (const char *filename, MaxCPlanarMaster &master, abacus::Master::STATUS &status)
	Writes feasible solutions as a file in PORTA format. More...

Public Member Functions inherited from ogdf::CPlanarSubgraphModule
	CPlanarSubgraphModule ()
	Constructs a cplanar subgraph module. More...

virtual	~CPlanarSubgraphModule ()
	Destruction. More...

ReturnType	call (const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges)
	Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph. More...

ReturnType	call (const ClusterGraph &G, List< edge > &delEdges)
	Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph. More...

Public Member Functions inherited from ogdf::Module
	Module ()
	Initializes a module. More...

virtual	~Module ()

Public Member Functions inherited from ogdf::Timeouter
	Timeouter ()
	timeout is turned of by default More...

	Timeouter (bool t)
	timeout is turned off (false) or on (true) (with 0 second) More...

	Timeouter (const Timeouter &t)

	Timeouter (double t)
	timeout is set to the given value (seconds) More...

	~Timeouter ()

bool	isTimeLimit () const
	returns whether any time limit is set or not More...

Timeouter &	operator= (const Timeouter &t)

double	timeLimit () const
	returns the current time limit for the call More...

void	timeLimit (bool t)
	shorthand to turn timelimit off or on (with 0 seconds) More...

void	timeLimit (double t)
	sets the time limit for the call (in seconds); <0 means no limit. More...

Protected Member Functions
virtual ReturnType	doCall (const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges) override
	Computes a maximum c-planar subgraph, returns the set of edges that have to be deleted in delEdges if delEdges is empty on return, the clustered graph G is c-planar. More...

virtual ReturnType	doCall (const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges)

void	getBottomUpClusterList (const cluster c, List< cluster > &theList)
	Stores clusters in subtree at c in bottom up order in theList. More...

double	getDoubleTime (const Stopwatch &act)

Private Member Functions
const char *	getIeqFileName ()

const char *	getPortaFileName ()

int	maxConLength ()

void	outputCons (std::ofstream &os, abacus::StandardPool< abacus::Constraint, abacus::Variable > connCon, abacus::StandardPool< abacus::Variable, abacus::Constraint > stdVar)

Private Attributes
double	m_branchingGap

bool	m_checkCPlanar

bool	m_defaultCutPool

int	m_heuristicLevel

int	m_heuristicNPermLists

double	m_heuristicOEdgeBound

int	m_heuristicRuns

double	m_heurTime

int	m_kSupportGraphs

double	m_kuratowskiHigh

int	m_kuratowskiIterations

double	m_kuratowskiLow

double	m_lpSolverTime

double	m_lpTime

int	m_numAddVariables

int	m_numBCs

int	m_numCCons

int	m_numKCons

int	m_numLPs

int	m_numSubSelected

int	m_numVars

bool	m_perturbation

bool	m_portaOutput

bool	m_pricing

double	m_sepTime

bool	m_solByHeuristic

double	m_strongConstraintViolation

double	m_strongVariableViolation

int	m_subdivisions

string	m_time

double	m_totalTime

double	m_totalWTime

Additional Inherited Members
Static Public Member Functions inherited from ogdf::Module
static bool	isSolution (ReturnType ret)
	Returns true iff `ret` indicates that the module returned a feasible solution. More...

Protected Attributes inherited from ogdf::Timeouter
double	m_timeLimit
	Time limit for module calls (< 0 means no limit). More...

Detailed Description

Exact computation of a maximum c-planar subgraph.

Definition at line 62 of file MaximumCPlanarSubgraph.h.

Member Typedef Documentation

◆ MaxCPlanarMaster

using ogdf::MaximumCPlanarSubgraph::MaxCPlanarMaster = cluster_planarity::MaxCPlanarMaster

Definition at line 65 of file MaximumCPlanarSubgraph.h.

◆ NodePairs

using ogdf::MaximumCPlanarSubgraph::NodePairs = List<NodePair>

Definition at line 64 of file MaximumCPlanarSubgraph.h.

Constructor & Destructor Documentation

◆ MaximumCPlanarSubgraph()

ogdf::MaximumCPlanarSubgraph::MaximumCPlanarSubgraph ( )

inline

Construction.

Definition at line 68 of file MaximumCPlanarSubgraph.h.

◆ ~MaximumCPlanarSubgraph()

ogdf::MaximumCPlanarSubgraph::~MaximumCPlanarSubgraph ( )

inline

Definition at line 107 of file MaximumCPlanarSubgraph.h.

Member Function Documentation

◆ callAndConnect()

ReturnType ogdf::MaximumCPlanarSubgraph::callAndConnect	(	const ClusterGraph &	G,
		const EdgeArray< double > *	pCost,
		List< edge > &	delEdges,
		NodePairs &	addedEdges
	)

inline

Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph and also returns a set of edges that augments the subgraph to be completely connected. For pure c-planarity testing, the computation can be sped up by setting setCheckCPlanar(2). Then, in case G is not c-planar, the list of deleted edges does not need to correspond to a valid solution, it just indicates the result.

Definition at line 123 of file MaximumCPlanarSubgraph.h.

◆ doCall() [1/2]

virtual ReturnType ogdf::MaximumCPlanarSubgraph::doCall	(	const ClusterGraph &	G,
		const EdgeArray< double > *	pCost,
		List< edge > &	delEdges
	)

inlineoverrideprotectedvirtual

Computes a maximum c-planar subgraph, returns the set of edges that have to be deleted in delEdges if delEdges is empty on return, the clustered graph G is c-planar.

Implements ogdf::CPlanarSubgraphModule.

Definition at line 228 of file MaximumCPlanarSubgraph.h.

◆ doCall() [2/2]

virtual ReturnType ogdf::MaximumCPlanarSubgraph::doCall	(	const ClusterGraph &	G,
		const EdgeArray< double > *	pCost,
		List< edge > &	delEdges,
		NodePairs &	addedEdges
	)

protectedvirtual

◆ getBottomUpClusterList()

void ogdf::MaximumCPlanarSubgraph::getBottomUpClusterList	(	const cluster	c,
		List< cluster > &	theList
	)

protected

Stores clusters in subtree at c in bottom up order in theList.

◆ getDoubleTime()

double ogdf::MaximumCPlanarSubgraph::getDoubleTime ( const Stopwatch & act )

inlineprotected

Definition at line 240 of file MaximumCPlanarSubgraph.h.

◆ getHeurTime()

double ogdf::MaximumCPlanarSubgraph::getHeurTime ( )

inline

Definition at line 187 of file MaximumCPlanarSubgraph.h.

◆ getIeqFileName()

const char* ogdf::MaximumCPlanarSubgraph::getIeqFileName ( )

inlineprivate

Definition at line 267 of file MaximumCPlanarSubgraph.h.

◆ getLPSolverTime()

double ogdf::MaximumCPlanarSubgraph::getLPSolverTime ( )

inline

Definition at line 191 of file MaximumCPlanarSubgraph.h.

◆ getLPTime()

double ogdf::MaximumCPlanarSubgraph::getLPTime ( )

inline

Definition at line 189 of file MaximumCPlanarSubgraph.h.

◆ getNumBCs()

int ogdf::MaximumCPlanarSubgraph::getNumBCs ( )

inline

Returns number of generated LPs.

Definition at line 207 of file MaximumCPlanarSubgraph.h.

◆ getNumCCons()

int ogdf::MaximumCPlanarSubgraph::getNumCCons ( )

inline

Returns number of connectivity constraints added during computation.

Definition at line 198 of file MaximumCPlanarSubgraph.h.

◆ getNumKCons()

int ogdf::MaximumCPlanarSubgraph::getNumKCons ( )

inline

Returns number of Kuratowski constraints added during computation.

Definition at line 201 of file MaximumCPlanarSubgraph.h.

◆ getNumLPs()

int ogdf::MaximumCPlanarSubgraph::getNumLPs ( )

inline

Returns number of optimized LPs (only LP-relaxations)

Definition at line 204 of file MaximumCPlanarSubgraph.h.

◆ getNumSubSelected()

int ogdf::MaximumCPlanarSubgraph::getNumSubSelected ( )

inline

Returns number of subproblems selected by ABACUS.

Definition at line 210 of file MaximumCPlanarSubgraph.h.

◆ getNumVars()

int ogdf::MaximumCPlanarSubgraph::getNumVars ( )

inline

Returns number of global variables. Todo: Real number from ABACUS.

Definition at line 213 of file MaximumCPlanarSubgraph.h.

◆ getPortaFileName()

const char* ogdf::MaximumCPlanarSubgraph::getPortaFileName ( )

inlineprivate

Definition at line 265 of file MaximumCPlanarSubgraph.h.

◆ getSeparationTime()

double ogdf::MaximumCPlanarSubgraph::getSeparationTime ( )

inline

Definition at line 193 of file MaximumCPlanarSubgraph.h.

◆ getSolByHeuristic()

bool ogdf::MaximumCPlanarSubgraph::getSolByHeuristic ( )

inline

Definition at line 219 of file MaximumCPlanarSubgraph.h.

◆ getTotalTime()

double ogdf::MaximumCPlanarSubgraph::getTotalTime ( )

inline

Definition at line 185 of file MaximumCPlanarSubgraph.h.

◆ getTotalWTime()

double ogdf::MaximumCPlanarSubgraph::getTotalWTime ( )

inline

Definition at line 195 of file MaximumCPlanarSubgraph.h.

◆ maxConLength()

int ogdf::MaximumCPlanarSubgraph::maxConLength ( )

inlineprivate

Definition at line 269 of file MaximumCPlanarSubgraph.h.

◆ outputCons()

void ogdf::MaximumCPlanarSubgraph::outputCons	(	std::ofstream &	os,
		abacus::StandardPool< abacus::Constraint, abacus::Variable > *	connCon,
		abacus::StandardPool< abacus::Variable, abacus::Constraint > *	stdVar
	)

private

◆ setBranchingGap()

void ogdf::MaximumCPlanarSubgraph::setBranchingGap ( double d )

inline

Definition at line 149 of file MaximumCPlanarSubgraph.h.

◆ setCheckCPlanar()

void ogdf::MaximumCPlanarSubgraph::setCheckCPlanar ( bool b )

inline

Definition at line 172 of file MaximumCPlanarSubgraph.h.

◆ setHeuristicBound()

void ogdf::MaximumCPlanarSubgraph::setHeuristicBound ( double d )

inline

Definition at line 133 of file MaximumCPlanarSubgraph.h.

◆ setHeuristicLevel()

void ogdf::MaximumCPlanarSubgraph::setHeuristicLevel ( int i )

inline

Definition at line 129 of file MaximumCPlanarSubgraph.h.

◆ setHeuristicRuns()

void ogdf::MaximumCPlanarSubgraph::setHeuristicRuns ( int i )

inline

Definition at line 131 of file MaximumCPlanarSubgraph.h.

◆ setLowerRounding()

void ogdf::MaximumCPlanarSubgraph::setLowerRounding ( double d )

inline

Definition at line 145 of file MaximumCPlanarSubgraph.h.

◆ setNumAddVariables()

void ogdf::MaximumCPlanarSubgraph::setNumAddVariables ( int n )

inline

Definition at line 174 of file MaximumCPlanarSubgraph.h.

◆ setNumberOfKuraIterations()

void ogdf::MaximumCPlanarSubgraph::setNumberOfKuraIterations ( int i )

inline

Definition at line 137 of file MaximumCPlanarSubgraph.h.

◆ setNumberOfPermutations()

void ogdf::MaximumCPlanarSubgraph::setNumberOfPermutations ( int i )

inline

Definition at line 135 of file MaximumCPlanarSubgraph.h.

◆ setNumberOfSubDivisions()

void ogdf::MaximumCPlanarSubgraph::setNumberOfSubDivisions ( int i )

inline

Definition at line 139 of file MaximumCPlanarSubgraph.h.

◆ setNumberOfSupportGraphs()

void ogdf::MaximumCPlanarSubgraph::setNumberOfSupportGraphs ( int i )

inline

Definition at line 141 of file MaximumCPlanarSubgraph.h.

◆ setPerturbation()

void ogdf::MaximumCPlanarSubgraph::setPerturbation ( bool b )

inline

Definition at line 147 of file MaximumCPlanarSubgraph.h.

◆ setPortaOutput()

void ogdf::MaximumCPlanarSubgraph::setPortaOutput ( bool b )

inline

Definition at line 168 of file MaximumCPlanarSubgraph.h.

◆ setPricing()

void ogdf::MaximumCPlanarSubgraph::setPricing ( bool b )

inline

Definition at line 170 of file MaximumCPlanarSubgraph.h.

◆ setStrongConstraintViolation()

void ogdf::MaximumCPlanarSubgraph::setStrongConstraintViolation ( double d )

inline

Definition at line 176 of file MaximumCPlanarSubgraph.h.

◆ setStrongVariableViolation()

void ogdf::MaximumCPlanarSubgraph::setStrongVariableViolation ( double d )

inline

Definition at line 178 of file MaximumCPlanarSubgraph.h.

◆ setTimeLimit() [1/2]

void ogdf::MaximumCPlanarSubgraph::setTimeLimit ( std::chrono::milliseconds milliSec )

inline

Definition at line 153 of file MaximumCPlanarSubgraph.h.

◆ setTimeLimit() [2/2]

void ogdf::MaximumCPlanarSubgraph::setTimeLimit ( string s )

inline

Definition at line 151 of file MaximumCPlanarSubgraph.h.

◆ setUpperRounding()

void ogdf::MaximumCPlanarSubgraph::setUpperRounding ( double d )

inline

Definition at line 143 of file MaximumCPlanarSubgraph.h.

◆ useDefaultCutPool()

bool& ogdf::MaximumCPlanarSubgraph::useDefaultCutPool ( )

inline

Use default abacus master cut pool or dedicated connectivity and kuratowski cut pools.

Definition at line 182 of file MaximumCPlanarSubgraph.h.

◆ writeFeasible()

void ogdf::MaximumCPlanarSubgraph::writeFeasible	(	const char *	filename,
		MaxCPlanarMaster &	master,
		abacus::Master::STATUS &	status
	)

Writes feasible solutions as a file in PORTA format.

Member Data Documentation

◆ m_branchingGap

double ogdf::MaximumCPlanarSubgraph::m_branchingGap

private

Definition at line 257 of file MaximumCPlanarSubgraph.h.

◆ m_checkCPlanar

bool ogdf::MaximumCPlanarSubgraph::m_checkCPlanar

private

Definition at line 260 of file MaximumCPlanarSubgraph.h.

◆ m_defaultCutPool

bool ogdf::MaximumCPlanarSubgraph::m_defaultCutPool

private

Definition at line 289 of file MaximumCPlanarSubgraph.h.

◆ m_heuristicLevel

int ogdf::MaximumCPlanarSubgraph::m_heuristicLevel

private

Definition at line 251 of file MaximumCPlanarSubgraph.h.

◆ m_heuristicNPermLists

int ogdf::MaximumCPlanarSubgraph::m_heuristicNPermLists

private

Definition at line 253 of file MaximumCPlanarSubgraph.h.

◆ m_heuristicOEdgeBound

double ogdf::MaximumCPlanarSubgraph::m_heuristicOEdgeBound

private

Definition at line 252 of file MaximumCPlanarSubgraph.h.

◆ m_heuristicRuns

int ogdf::MaximumCPlanarSubgraph::m_heuristicRuns

private

Definition at line 251 of file MaximumCPlanarSubgraph.h.

◆ m_heurTime

double ogdf::MaximumCPlanarSubgraph::m_heurTime

private

Definition at line 277 of file MaximumCPlanarSubgraph.h.

◆ m_kSupportGraphs

int ogdf::MaximumCPlanarSubgraph::m_kSupportGraphs

private

Definition at line 254 of file MaximumCPlanarSubgraph.h.

◆ m_kuratowskiHigh

double ogdf::MaximumCPlanarSubgraph::m_kuratowskiHigh

private

Definition at line 255 of file MaximumCPlanarSubgraph.h.

◆ m_kuratowskiIterations

int ogdf::MaximumCPlanarSubgraph::m_kuratowskiIterations

private

Definition at line 253 of file MaximumCPlanarSubgraph.h.

◆ m_kuratowskiLow

double ogdf::MaximumCPlanarSubgraph::m_kuratowskiLow

private

Definition at line 255 of file MaximumCPlanarSubgraph.h.

◆ m_lpSolverTime

double ogdf::MaximumCPlanarSubgraph::m_lpSolverTime

private

Definition at line 279 of file MaximumCPlanarSubgraph.h.

◆ m_lpTime

double ogdf::MaximumCPlanarSubgraph::m_lpTime

private

Definition at line 278 of file MaximumCPlanarSubgraph.h.

◆ m_numAddVariables

int ogdf::MaximumCPlanarSubgraph::m_numAddVariables

private

Definition at line 261 of file MaximumCPlanarSubgraph.h.

◆ m_numBCs

int ogdf::MaximumCPlanarSubgraph::m_numBCs

private

Definition at line 285 of file MaximumCPlanarSubgraph.h.

◆ m_numCCons

int ogdf::MaximumCPlanarSubgraph::m_numCCons

private

Definition at line 282 of file MaximumCPlanarSubgraph.h.

◆ m_numKCons

int ogdf::MaximumCPlanarSubgraph::m_numKCons

private

Definition at line 283 of file MaximumCPlanarSubgraph.h.

◆ m_numLPs

int ogdf::MaximumCPlanarSubgraph::m_numLPs

private

Definition at line 284 of file MaximumCPlanarSubgraph.h.

◆ m_numSubSelected

int ogdf::MaximumCPlanarSubgraph::m_numSubSelected

private

Definition at line 286 of file MaximumCPlanarSubgraph.h.

◆ m_numVars

int ogdf::MaximumCPlanarSubgraph::m_numVars

private

Definition at line 287 of file MaximumCPlanarSubgraph.h.

◆ m_perturbation

bool ogdf::MaximumCPlanarSubgraph::m_perturbation

private

Definition at line 256 of file MaximumCPlanarSubgraph.h.

◆ m_portaOutput

bool ogdf::MaximumCPlanarSubgraph::m_portaOutput

private

Definition at line 288 of file MaximumCPlanarSubgraph.h.

◆ m_pricing

bool ogdf::MaximumCPlanarSubgraph::m_pricing

private

Definition at line 259 of file MaximumCPlanarSubgraph.h.

◆ m_sepTime

double ogdf::MaximumCPlanarSubgraph::m_sepTime

private

Definition at line 280 of file MaximumCPlanarSubgraph.h.

◆ m_solByHeuristic

bool ogdf::MaximumCPlanarSubgraph::m_solByHeuristic

private

Definition at line 291 of file MaximumCPlanarSubgraph.h.

◆ m_strongConstraintViolation

double ogdf::MaximumCPlanarSubgraph::m_strongConstraintViolation

private

Definition at line 262 of file MaximumCPlanarSubgraph.h.

◆ m_strongVariableViolation

double ogdf::MaximumCPlanarSubgraph::m_strongVariableViolation

private

Definition at line 263 of file MaximumCPlanarSubgraph.h.

◆ m_subdivisions

int ogdf::MaximumCPlanarSubgraph::m_subdivisions

private

Definition at line 254 of file MaximumCPlanarSubgraph.h.

◆ m_time

string ogdf::MaximumCPlanarSubgraph::m_time

private

Definition at line 258 of file MaximumCPlanarSubgraph.h.

◆ m_totalTime

double ogdf::MaximumCPlanarSubgraph::m_totalTime

private

Definition at line 276 of file MaximumCPlanarSubgraph.h.

◆ m_totalWTime

double ogdf::MaximumCPlanarSubgraph::m_totalWTime

private

Definition at line 281 of file MaximumCPlanarSubgraph.h.

The documentation for this class was generated from the following file:

include/ogdf/cluster/MaximumCPlanarSubgraph.h

OpenGraph DrawingFramework

Public Types

Public Member Functions

Protected Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ MaxCPlanarMaster

◆ NodePairs

Constructor & Destructor Documentation

◆ MaximumCPlanarSubgraph()

◆ ~MaximumCPlanarSubgraph()

Member Function Documentation

◆ callAndConnect()

◆ doCall() [1/2]

◆ doCall() [2/2]

◆ getBottomUpClusterList()

◆ getDoubleTime()

◆ getHeurTime()

◆ getIeqFileName()

◆ getLPSolverTime()

◆ getLPTime()

◆ getNumBCs()

◆ getNumCCons()

◆ getNumKCons()

◆ getNumLPs()

◆ getNumSubSelected()

◆ getNumVars()

◆ getPortaFileName()

◆ getSeparationTime()

◆ getSolByHeuristic()

◆ getTotalTime()

◆ getTotalWTime()

◆ maxConLength()

◆ outputCons()

◆ setBranchingGap()

◆ setCheckCPlanar()

◆ setHeuristicBound()

◆ setHeuristicLevel()

◆ setHeuristicRuns()

◆ setLowerRounding()

◆ setNumAddVariables()

◆ setNumberOfKuraIterations()

◆ setNumberOfPermutations()

◆ setNumberOfSubDivisions()

◆ setNumberOfSupportGraphs()

◆ setPerturbation()

◆ setPortaOutput()

◆ setPricing()

◆ setStrongConstraintViolation()

◆ setStrongVariableViolation()

◆ setTimeLimit() [1/2]

◆ setTimeLimit() [2/2]

◆ setUpperRounding()

◆ useDefaultCutPool()

◆ writeFeasible()

Member Data Documentation

◆ m_branchingGap

◆ m_checkCPlanar

◆ m_defaultCutPool

◆ m_heuristicLevel

◆ m_heuristicNPermLists

◆ m_heuristicOEdgeBound

◆ m_heuristicRuns

◆ m_heurTime

◆ m_kSupportGraphs

◆ m_kuratowskiHigh

◆ m_kuratowskiIterations

◆ m_kuratowskiLow

◆ m_lpSolverTime

◆ m_lpTime

◆ m_numAddVariables

◆ m_numBCs

◆ m_numCCons

◆ m_numKCons

◆ m_numLPs

◆ m_numSubSelected

◆ m_numVars

Open
Graph Drawing
Framework