dynamic_programming_graph Struct Reference

Detailed Description

compressed graph with less information

Definition at line 71 of file dptermsinterns.h.

#include <dptermsinterns.h>

Data Fields
int *	terminals
int *	nodes_termId
int	nnodes
int	nedges
int	nterms

Field Documentation

terminals

int* dynamic_programming_graph::terminals

array of terminals; in {0,1,...,nnodes - 1}

Definition at line 73 of file dptermsinterns.h.

Referenced by allExtensionsAreInvalid(), dpgraphFree(), dpgraphInit(), dpiterGetNextSol(), and dpsolverInitData().

nodes_termId

int* dynamic_programming_graph::nodes_termId

per node: terminal (0,1,..), or -1 if non-terminal

Definition at line 74 of file dptermsinterns.h.

Referenced by dpgraphFree(), dpgraphInit(), subtreesExtend(), and subtreesRemoveNonValids().

nnodes

int dynamic_programming_graph::nnodes

number of nodes

Definition at line 75 of file dptermsinterns.h.

Referenced by dpgraphInit().

nedges

int dynamic_programming_graph::nedges

number of edges

Definition at line 76 of file dptermsinterns.h.

Referenced by dpgraphInit().

nterms

int dynamic_programming_graph::nterms

number of terminals

Definition at line 77 of file dptermsinterns.h.

Referenced by dpgraphInit(), dpiterGetNextSol(), and updateIncumbent().