DominoParitySeparator Data Structures

Here are the data structures with brief descriptions:

BM_graph
CC_SFILE
CC_SPORT
CCbigchunk
CCbigchunkptr
CCdata_rhvector
CCdata_user
CCdatagroup
CCdheap
CCelist
CCelistl
CCelistlw
CCelistw
CCgenhash
CCgenhash_iter
CCpriority
CCpriority::CCpri_data
CCptrworld
CCrandstate
CCsubdiv
CCsubdiv_lkh
CCtsp_bigdual
CCtsp_branchobj
CCtsp_cutinfo
CCtsp_cutnode
CCtsp_cutselect
CCtsp_cuttree
CCtsp_edgegenerator
CCtsp_extraedge
CCtsp_genadj
CCtsp_genadjobj
CCtsp_lp
CCtsp_lp_result
CCtsp_lpadj
CCtsp_lpclique
CCtsp_lpcut
CCtsp_lpcut_in
CCtsp_lpcuts
CCtsp_lpdomino
CCtsp_lpedge
CCtsp_lpgraph
CCtsp_lpnode
CCtsp_lprow
CCtsp_predge
CCtsp_pricegroup
CCtsp_PROB_FILE
CCtsp_qsparsegroup
CCtsp_segment
CCtsp_skeleton
CCtsp_sparser
CCtsp_statistics
CCtsp_tighten_info
CCtsp_xnorm_pricer
CCtsp_xnorm_pricer_val
CCutil_edgehash
CCutil_edgeinf
CCutil_timer
cuts_info
DPedgeSet
DPspanningEdge
DPspanningNode
DPTEdata_t	Structure holding information regarding every edge
DPTFullMove_t	Dull move structure
DPTGdata_t	Structure to hold information about the graph
DPTMove_t	Structure to hold a movement
DPTNdata_t
EGcutSeed_t
EGcycleData_t
EGdcutIter_t
EGddomino_t
EGddpConstraint_t
EGdkdomino_t
EGdkpc_t
EGdualCut_t	Structure to hold simple dual cuts, we store them as the set of edges in its interface, note that we may have edges more than once, the meaning is that the cut is defined by the edges that are an odd number of times in the array
EGgreedyData_t
EGinternalPairs_t
EGnetDdom_t
EGpkpc_t
extFaceLinkRec
graphNode
isolatorContext
KPTEdata_t	Structure holding information regarding every edge
KPTFullMove_t	Full move structure
KPTGdata_t	Structure to hold information about the graph
KPTMove_t	Structure to hold a movement
KPTNdata_t
lcnode
listCollectionRec
localEdge_t
setlist
stack
vertexRec

---