#include <abstractGraph.h>
Inheritance diagram for abstractGraph:
Public Member Functions | |
abstractGraph (TNode _n=0, TArc _m=0) throw () | |
virtual | ~abstractGraph () throw () |
unsigned long | Allocated () const throw () |
bool | IsUndirected () const throw () |
virtual bool | MaximumMatching () throw () |
virtual bool | MaximumMatching (TCap cDeg) throw () |
virtual bool | MaximumMatching (TCap *pLower, TCap *pDeg=NULL) throw () |
virtual bool | MinCMatching () throw () |
virtual bool | MinCMatching (TCap cDeg) throw () |
virtual bool | MinCMatching (TCap *pLower, TCap *pDeg=NULL) throw () |
TFloat | MinCEdgeCover () throw (ERRejected) |
void | MinCTJoin (const indexSet< TNode > &Terminals) throw () |
bool | SPX_TJoin (TNode s, TNode t) throw (ERRange) |
void | ChinesePostman (bool adjustUCap) throw (ERRejected) |
Protected Member Functions | |
TFloat | STT_Heuristic (const indexSet< TNode > &Terminals, TNode root) throw (ERRange) |
TFloat | STT_Enumerate (const indexSet< TNode > &Terminals, TNode root) throw (ERRange) |
virtual TFloat | TSP_Heuristic (THeurTSP method, TNode root) throw (ERRange,ERRejected) |
TFloat | TSP_HeuristicChristofides (TNode r=NoNode) throw (ERRange) |
bool | TSP_2Exchange (TArc *pred, TFloat limit=0) throw (ERRejected) |
TFloat | TSP_SubOpt1Tree (TRelaxTSP method, TNode root, TFloat &bestUpper, bool branchAndBound) throw (ERRange) |
TFloat | TSP_BranchAndBound (TRelaxTSP method, int nCandidates, TNode root, TFloat upperBound) throw () |
TFloat | PMHeuristicsRandom () throw () |
void | ComputeTJoin (const indexSet< TNode > &Terminals) throw (ERRejected) |
TFloat | MXC_Heuristic (TMethMaxCut method, TNode s=NoNode, TNode t=NoNode) throw (ERRange,ERRejected) |
TFloat | MXC_HeuristicTree (TNode s=NoNode, TNode t=NoNode) throw (ERRange,ERRejected) |
TFloat | MXC_DualTJoin (TNode s=NoNode) throw (ERRange,ERRejected) |
|
|
|
|
|
Reimplemented from abstractMixedGraph. Reimplemented in abstractBiGraph, denseBiGraph, denseGraph, sparseBiGraph, and sparseGraph. |