Concorde organizational index

Function index Program index Macro index Data Types index

UTIL/sortrus.c

CCutil_linked_radixsort - radix-sort a linked list
CCutil_int_array_quicksort - quick-sort an integer array
CCutil_int_perm_quicksort - quick-sort a permutation of integers
CCutil_double_perm_quicksort - quick-sort a permutation of doubles
CCutil_rselect - divide a permutation of integers into the m smallest and the rest

UTIL/zeit.c

CCutil_zeit - measure cpu time
CCutil_real_zeit - measure real time
CCutil_init_timer - initialize a timer
CCutil_start_timer - start a timer running
CCutil_suspend_timer - suspend a timer
CCutil_resume_timer - resume a suspended timer
CCutil_stop_timer - stop a timer
CCutil_total_timer - get the total time in a timer

UTIL/util.c

CCutil_nextprime - find the next larger prime
CCutil_our_gcd - find the greatest common divisor (gcd) of two numbers
CCutil_our_lcm - find the lowest common multiple (lcm) of two numbers
CCutil_strchr - search a string for a character
CCutil_strrchr - search a string backwards for a character
CCutil_strchr_c - search a constant string for a character
CCutil_strrchr_c - search a constant string backwards for a character
CCutil_strdup - duplicate a string, allocating space for the copy
CCutil_strdup2 - duplicate a string, stopping at the first whitespace
CCutil_readstr - read a string, terminated by whitespace or EOF
CCutil_printlabel - print information identifying the host computer

UTIL/urandom.c

CCutil_sprand - initialize the portable random number generator
CCutil_lprand - get a random integer from the portable random number generator
CCutil_normrand - get a normally distributed random variable

UTIL/signal.c

CCutil_signal_handler - specify a handler for a signal
CCutil_signal_default - restore the default handler for a signal
CCutil_signal_ignore - ignores (blocks) a signal
CCutil_sig_to_ccsig - map O/S signal numbers to concorde signal numbers
CCutil_signal_init - initialize signal handling functions to the defaults
CCutil_handler_fatal - signal handler which outputs an error message, waits, then exits
CCutil_handler_warn - signal handler which outputs a warning message
CCutil_handler_exit - signal handler which outputs a message and exits

UTIL/safe_io.c

CCutil_sopen - open a file for buffered binary I/O (CC_SFILE)
CCutil_sdopen - open a descriptor for buffered binary I/O (CC_SFILE)
CCutil_swrite - write data to a CC_SFILE
CCutil_swrite_bits - write bits to a CC_FILE
CCutil_swrite_ubits - write unsigned bits to a CC_SFILE
CCutil_swrite_char - write a char to a CC_SFILE
CCutil_swrite_string - write a string to a CC_SFILE
CCutil_swrite_short - write a short to a CC_SFILE
CCutil_swrite_ushort - write an unsigned short to a CC_SFILE
CCutil_swrite_int - write an int to a CC_SFILE
CCutil_swrite_uint - write an unsigned int to a CC_SFILE
CCutil_swrite_double - write a double to a CC_SFILE
CCutil_sread - read data from a CC_SFILE
CCutil_sread_bits - read bits from a CC_SFILE
CCutil_sread_ubits - read unsigned bits from a CC_SFILE
CCutil_sread_char - read a char from a CC_SFILE
CCutil_sread_string - read a string from a CC_SFILE
CCutil_sread_short - read a short from a CC_SFILE
CCutil_sread_ushort - read an unsigned short from a CC_SFILE
CCutil_sread_short_r - read a reversed short from a CC_SFILE
CCutil_sread_int - read an int from a CC_SFILE
CCutil_sread_uint - read an unsigned int from a CC_SFILE
CCutil_sread_int_r - read a reversed int from a CC_SFILE
CCutil_sread_double - read a double from a CC_SFILE
CCutil_sread_double_r - read a reversed double from a CC_SFILE
CCutil_sflush - flush the buffers of a CC_SFILE
CCutil_stell - report the current location in a CC_SFILE
CCutil_sseek - set the location in a CC_SFILE
CCutil_srewind - rewind a CC_SFILE
CCutil_sclose - close a CC_SFILE
CCutil_sbits - compute the number of bits necessary to represent an integer
CCutil_sdelete_file - delete a file
CCutil_sdelete_file_backup - delete the backup file created by a CCutil_sopen
CCutil_snet_open - open a network CC_SFILE connection
CCutil_snet_receive - receive a network CC_SFILE connection
CCutil_snet_listen - listen for network CC_SFILE connections
CCutil_snet_unlisten - quit listening for network CC_SFILE connections

UTIL/priority.c

CCutil_priority_init - initialize a priority queue
CCutil_priority_free - free a priority queue
CCutil_priority_findmin - find the minimum in a priority queue
CCutil_priority_insert - insert an entry into a priority queue
CCutil_priority_delete - delete an entry from a priority queue
CCutil_priority_deletemin - delete and return the minimum entry in a priority queue
CCutil_priority_changekey - change the key of an entry in a priority queue

UTIL/getdata.c

CCutil_getdata - build (by reading or generating) a CCdatagroup for computing edge lengths
CCutil_putmaster - write a problem master file
CCutil_writemaster - write the problem master data to a CC_SFILE
CCutil_getmaster - read a problem master file
CCutil_readmaster - read the problem master data from a CC_SFILE
CCutil_getnodeweights - read (or generate) node weights
CCutil_gettsplib - read a TSPLIB instance
CCutil_writetsplib - write a TSPLIB instance
CCutil_getedgelist - read an edgelist, verifying ncount
CCutil_getedgelist_n - read an edgelist, reading ncount
CCutil_genedgelist - generate a random edge list
CCutil_getcycle_edgelist - read a cycle in edge list format
CCutil_getcycle - read a cycle in permutation format
CCutil_cycle_len - compute the length of a tour
CCutil_getedges_double - read an edgelist with floating-point lengths
CCutil_writeedges - write an edgelist
CCutil_writecycle_edgelist - write a cycle in edgelist format
CCutil_writecycle - write a cycle in permutation format
CCutil_writeedges_int - write an edgelist, specifying the lengths
CCutil_writeedges_double - write an edgelist, specifying the lengths in floating point
CCutil_datagroup_perm - permute a CCdatagroup
CCutil_copy_datagroup - copy a CCdatagroup
CCutil_tri2dat - convert an upper triangular matrix of edge lengths to a CCdatagroup
CCutil_graph2dat_matrix - convert a matrix of edge lengths to a CCdatagroup
CCutil_graph2dat_sparse - convert a sparse edge list to a CCdatagroup
CCutil_get_sparse_dat_edges - convert a CCdatagroup of norm CC_SPARSE to a sparse edge list
CCutil_sparse_strip_edges - remove the artifical edges from an edge list
CCutil_sparse_real_tour - check to see if every edge in a cycle is in a CC_SPARSE datagroup

UTIL/genhash.c

CCutil_genhash_init - initialize a generic hash table
CCutil_genhash_free - free a generic hash table
CCutil_genhash_u_data - change the user data stored with a generic hash table
CCutil_genhash_insert - insert an entry into a generic hash table
CCutil_genhash_replace - replace an entry in a generic hash table
CCutil_genhash_delete - delete an entry from a generic hash table
CCutil_genhash_lookup - look up an entry in a generic hash table
CCutil_genhash_hash - compute the hash function of a key in a generic hash table
CCutil_genhash_insert_h - insert an entry into a generic hash table (given the hash value)
CCutil_genhash_replace_h - replace an entry in a generic hash table (given the hash value)
CCutil_genhash_delete_h - delete an entry from a generic hash table (given the hash value)
CCutil_genhash_lookup_h - look up an entry in a generic hash table (given the hash value)
CCutil_genhash_start - begin iterating over the elements of a generic hash table
CCutil_genhash_next - move the iterator over a generic hash table to the next element

UTIL/fastread.c

CCutil_readint - read an integer quickly

UTIL/eunion.c

CCutil_edge_file_union - read several edge lists and merge the results

UTIL/edgeutil.c

CCutil_edge_to_cycle - convert an edge list to a cycle
CCelist_init - initialize a CCelist
CCelistl_init - initialize a CCelistl
CCelistw_init - initialize a CCelistw
CCelistlw_init - initialize a CCelistlw
CCelist_free - free a CCelist
CCelistl_free - free a CCelistl
CCelistw_free - free a CCelistw
CCelistlw_free - free a CCelistlw
CCelist_alloc - allocate space for a CCelist
CCelistl_alloc - allocate space for a CCelistl
CCelistw_alloc - allocate space for a CCelistw
CCelistlw_alloc - CCelistlw

UTIL/edgelen.c

CCutil_dat_setnorm - set the norm for a CCdatagroup
CCutil_dat_edgelen - compute the length of an edge
CCutil_dsjrand_init - initialize the dsjrand norm
CCutil_dat_getnorm - get the norm of a CCdatagroup
CCutil_init_datagroup - initialize a CCdatagroup
CCutil_freedatagroup - free a CCdatagroup

UTIL/dheaps_i.c

CCutil_dheap_init - initialize a d-heap
CCutil_dheap_free - free a d-heap
CCutil_dheap_resize - resize a d-heap
CCutil_dheap_findmin - find the minimum entry in a d-heap
CCutil_dheap_insert - insert an entry into a d-heap
CCutil_dheap_delete - delete an entry from a d-heap
CCutil_dheap_deletemin - delete and return the minimum entry in a d-heap
CCutil_dheap_changekey - change the key of an entry in a d-heap

UTIL/bgetopt.c

CCutil_bix_getopt - parse an argument list

UTIL/allocrus.c

CCutil_allocrus - allocate a block of memory
CCutil_freerus - free a block of memory
CCutil_reallocrus - change the size of an allocated block of memory
CCutil_reallocrus_scale - change the size of an allocated block of memory by a scale factor
CCutil_reallocrus_count - change the size of an allocated block of memory to a specified count
CCutil_bigchunkalloc - allocate a CCbigchunk
CCutil_bigchunkfree - free a CCbigchunk
CCptrworld_init - initialize a CCptrworld with 1 reference
CCptrworld_add - add a reference to a CCptrworld
CCptrworld_delete - delete a reference to a ptrworld, and free if no more references

TSP/xtour.c

CCtsp_x_greedy_tour - find a tour by adding in edges by nonincreasing x value
CCtsp_x_greedy_tour_lk - find an x-greedy tour and then run a short Lin-Kernighan

TSP/tsp_lp.c

CCtsp_init_tsp_lp_struct - initialize a CCtsp_lp
CCtsp_free_tsp_lp_struct - free a CCtsp_lp
CCtsp_init_lp - build/read an initial problem in a CCtsp_lp
CCtsp_bb_init_lp - short from of CCtsp_init_lp for use in branch and bound
CCtsp_get_lp_result
CCtsp_lpcut_in_nzlist
CCtsp_add_cut
CCtsp_add_nzlist_to_lp
CCtsp_add_multiple_rows
CCtsp_delete_cut
CCtsp_write_probfile_sav
CCtsp_write_probfile_id
CCtsp_write_probroot_id
CCtsp_add_cuts_to_queue
CCtsp_process_cuts
CCtsp_addbad_variables
CCtsp_eliminate_variables
CCtsp_cutprice
CCtsp_add_vars_to_lp
CCtsp_update_result
CCtsp_infeas_recover
CCtsp_build_lpgraph
CCtsp_build_lpadj
CCtsp_find_edge
CCtsp_init_lpgraph_struct
CCtsp_free_lpgraph
CCtsp_init_lprow
CCtsp_free_lprow
CCtsp_inspect_full_edges
CCtsp_resparsify_lp
CCtsp_read_probfile
CCtsp_read_probfile_id
CCtsp_dump_x

TSP/tsp_call.c

CCtsp_solve_sparse
CCtsp_solve_dat

TSP/teething.c

CCtsp_teething
CCtsp_teething_list

TSP/skeleton.c

CCtsp_init_skeleton
CCtsp_free_skeleton
CCtsp_copy_skeleton
CCtsp_read_skeleton
CCtsp_write_skeleton
CCtsp_construct_skeleton
CCtsp_compare_skeletons

TSP/qsparse.c

CCtsp_qsparsify
CCtsp_free_qsparsify

TSP/prob_io.c

CCtsp_prob_read
CCtsp_prob_read_name
CCtsp_prob_write
CCtsp_prob_write_name
CCtsp_prob_file_delete
CCtsp_prob_getname
CCtsp_prob_getid
CCtsp_prob_getparent
CCtsp_prob_getub
CCtsp_prob_getlb
CCtsp_prob_getexactlb
CCtsp_prob_getnnodes
CCtsp_prob_getchildren
CCtsp_prob_getreal
CCtsp_prob_getprocessed
CCtsp_prob_getinfeasible
CCtsp_prob_gettour
CCtsp_prob_getedges
CCtsp_prob_getcuts
CCtsp_prob_getwarmstart
CCtsp_prob_getfulladj
CCtsp_prob_getfixed
CCtsp_prob_getexactdual
CCtsp_prob_gethistory
CCtsp_prob_rclose
CCtsp_prob_putname
CCtsp_prob_putid
CCtsp_prob_putparent
CCtsp_prob_putub
CCtsp_prob_putlb
CCtsp_prob_putexactlb
CCtsp_prob_putnnodes
CCtsp_prob_putchildren
CCtsp_prob_putreal
CCtsp_prob_putprocessed
CCtsp_prob_putinfeasible
CCtsp_prob_puttour
CCtsp_prob_putedges
CCtsp_prob_putcuts
CCtsp_prob_putwarmstart
CCtsp_prob_putfulladj
CCtsp_prob_putfixed
CCtsp_prob_putexact_dual
CCtsp_prob_puthistory
CCtsp_prob_wclose
CCtsp_prob_copy_section
CCtsp_problabel
CCtsp_prob_read_remote
CCtsp_prob_write_remote
CCtsp_prob_server
CCtsp_prob_delete_remote

TSP/prclique.c

CCtsp_pr_cliquetree

TSP/growcomb.c

CCtsp_edge_comb_grower

TSP/generate.c

CCtsp_init_edgegenerator
CCtsp_free_edgegenerator
CCtsp_reset_edgegenerator
CCtsp_generate_edges
CCtsp_edgelist_to_genadj

TSP/ex_price.c

CCtsp_exact_price
CCtsp_edge_elimination
CCtsp_exact_dual
CCtsp_verify_infeasible_lp
CCtsp_verify_lp_prune

TSP/ddecker.c

CCtsp_test_pure_double_decker
CCtsp_comb_to_double_decker
CCtsp_comb_to_star
CCtsp_comb_handling

TSP/cutpool.c

CCtsp_init_cutpool
CCtsp_search_cutpool
CCtsp_search_remotepool
CCtsp_search_cutpool_cliques
CCtsp_add_cut_to_cutlist
CCtsp_delete_cut_from_cutlist
CCtsp_free_cutpool
CCtsp_write_cutpool
CCtsp_branch_cutpool_cliques
CCtsp_price_cuts
CCtsp_price_cuts_threaded
CCtsp_get_clique_prices
CCtsp_get_clique
CCtsp_display_cutpool
CCtsp_add_to_cutpool
CCtsp_add_to_cutpool_lpcut_in
CCtsp_free_lpcut_in
CCtsp_free_lpclique
CCtsp_read_cuts
CCtsp_read_lpcut_in
CCtsp_read_lpclique
CCtsp_send_newcuts
CCtsp_write_cuts
CCtsp_write_lpcut_in
CCtsp_write_lpcut
CCtsp_write_lpclique
CCtsp_copy_cuts
CCtsp_register_cliques
CCtsp_unregister_cliques

TSP/cutcall.c

CCtsp_connect_cuts
CCtsp_segment_cuts
CCtsp_exact_subtours
CCtsp_tighten_lp
CCtsp_double_decker_lp
CCtsp_cliquetree_lp
CCtsp_star_lp
CCtsp_handling_lp
CCtsp_handling_lp
CCtsp_teething_lp
CCtsp_file_cuts
CCtsp_file_cuts_write
CCtsp_test_pure_comb
CCtsp_test_pseudocomb
CCtsp_test_teeth_disjoint
CCtsp_find_pure_handle
CCtsp_buildcut_begin
CCtsp_buildcut_addclique
CCtsp_buildcut_finish
CCtsp_buildcut_abort

TSP/control.c

CCtsp_init_cutselect
CCtsp_init_tentative_cutselect
CCtsp_cutselect_set_tols
CCtsp_cutting_loop
CCtsp_subtour_loop
CCtsp_blossom_loop
CCtsp_subtour_and_blossom_loop
CCtsp_pricing_loop
CCtsp_call_x_heuristic
CCtsp_bb_cutting

TSP/combcliq.c

CCtsp_test_pure_simple_cliquetree
CCtsp_comb_to_cliquetree

TSP/cliqwork.c

CCtsp_mark_clique
CCtsp_mark_clique_and_neighbors
CCtsp_mark_clique_and_neighbors_double
CCtsp_mark_cut
CCtsp_mark_cut_and_neighbors
CCtsp_is_clique_marked
CCtsp_clique_count
CCtsp_clique_marked_count
CCtsp_clique_to_array
CCtsp_clique_delta
CCtsp_segment_to_subtour
CCtsp_array_to_subtour
CCtsp_init_lpcut_in
CCtsp_init_lpclique
CCtsp_array_to_lpclique
CCtsp_seglist_to_lpclique
CCtsp_shrunk_set_to_lpclique
CCtsp_add_nodes_to_lpclique
CCtsp_delete_nodes_from_lpclique
CCtsp_print_lpcut_in
CCtsp_print_lpclique
CCtsp_copy_lpcut_in
CCtsp_lpcut_to_lpcut_in
CCtsp_lpclique_compare
CCtsp_copy_lpclique
CCtsp_create_lpcliques
CCtsp_max_node

TSP/cliqhash.c

CCtsp_init_cliquehash
CCtsp_register_clique
CCtsp_free_cliquehash
CCtsp_unregister_clique
CCtsp_clique_eq
CCtsp_hashclique

TSP/branch.c

CCtsp_find_branch
CCtsp_find_branch_edge
CCtsp_check_integral
CCtsp_find_branch_cliques
CCtsp_test_cut_branch
CCtsp_init_branchobj
CCtsp_free_branchobj
CCtsp_print_branchhistory
CCtsp_execute_branch
CCtsp_execute_unbranch
CCtsp_add_branchhistory_to_lp
CCtsp_bb_find_branch
CCtsp_splitprob
CCtsp_bb_splitprob
CCtsp_dumptour

TSP/blossom.c

CCtsp_exactblossom
CCtsp_fastblossom
CCtsp_ghfastblossom

TSP/blkcomb.c

CCtsp_block_combs

TSP/bcontrol.c

CCtsp_bfs_brancher
CCtsp_bfs_restart
CCtsp_grunt
CCtsp_easy_dfs_brancher
CCtsp_do_interactive_branch

PQ/pq.c

CCpq_tree_init
CCpq_tree_free
CCpq_describe_solution
CCpq_dump_solution
CCpq_check
CCpq_apply
CCpq_tree_trivial
CCpq_cuttree_to_pq
CCpq_find_root

PQ/necklace.c

CCpq_necklaces

PQ/consec1.c

CCpq_consecutiveones

LP/lp_none.c

CClp_init
CClp_force_perturb
CClp_tune_small
CClp_disable_presolve
CClp_free
CClp_freelp
CClp_loadlp
CClp_create
CClp_new_row
CClp_change_sense
CClp_opt
CClp_limited_dualopt
CClp_addrows
CClp_addcols
CClp_delete_row
CClp_delete_set_of_rows
CClp_delete_column
CClp_delete_set_of_columns
CClp_setbnd
CClp_get_warmstart
CClp_load_warmstart
CClp_build_warmstart
CClp_free_warmstart
CClp_sread_warmstart
CClp_swrite_warmstart
CClp_get_info
CClp_create_info
CClp_is_col_active
CClp_is_row_active
CClp_set_col_active
CClp_set_col_inactive
CClp_set_col_upper
CClp_set_row_active
CClp_set_row_inactive
CClp_free_info
CClp_x
CClp_rc
CClp_pi
CClp_objval
CClp_nrows
CClp_ncols
CClp_nnonzeros
CClp_status
CClp_getweight
CClp_dump_lp
CClp_getgoodlist
CClp_strongbranch
CClp_pivotout
CClp_pivotin

LINKERN/linkern.c

CClinkern_tour

LINKERN/flip_two.c

CClinkern_flipper_init
CClinkern_flipper_cycle
CClinkern_flipper_finish
CClinkern_flipper_next
CClinkern_flipper_prev
CClinkern_flipper_flip
CClinkern_flipper_sequence

KDTREE/kdtwoopt.c

CCkdtree_twoopt_tour
CCkdtree_3opt_tour

KDTREE/kdspan.c

CCkdtree_prim_spanningtree
CCkdtree_greedy_tour
CCkdtree_far_add_tour
CCkdtree_qboruvka_tour
CCkdtree_boruvka_tour

KDTREE/kdnear.c

CCkdtree_k_nearest
CCkdtree_quadrant_k_nearest
CCkdtree_node_k_nearest
CCkdtree_node_quadrant_k_nearest
CCkdtree_node_nearest
CCkdtree_fixed_radius_nearest
CCkdtree_nearest_neighbor_tour
CCkdtree_nearest_neighbor_2match

KDTREE/kdbuild.c

CCkdtree_build
CCkdtree_free
CCkdtree_delete
CCkdtree_undelete
CCkdtree_delete_all
CCkdtree_undelete_all

HELDKARP/heldkarp.c

CCheldkarp_small
CCheldkarp_small_elist

FMATCH/fmatch.c

CCfmatch_fractional_2match

EDGEGEN/xnear.c

CCedgegen_x_k_nearest
CCedgegen_x_quadrant_k_nearest
CCedgegen_x_node_k_nearest
CCedgegen_x_node_quadrant_k_nearest
CCedgegen_x_node_nearest
CCedgegen_x_nearest_neighbor_tour
CCedgegen_junk_k_nearest
CCedgegen_junk_node_k_nearest
CCedgegen_junk_node_nearest
CCedgegen_junk_nearest_neighbor_tour
CCedgegen_xnear_build
CCedgegen_xnear_free

EDGEGEN/mlinkern.c

CCedgegen_mlinkern

EDGEGEN/edgegen.c

CCedgegen_read
CCedgegen_edges
CCedgegen_init_edgegengroup

EDGEGEN/delaunay.c

CCedgegen_delaunay

CUT/shrink.c

CUT/segments.c

CCcut_linsub
CCcut_linsub_allcuts

CUT/mincut.c

CCcut_mincut
CCcut_violated_cuts

CUT/gomoryhu.c

CCcut_gomory_hu
CCcut_GHtreefree
CCcut_GHtreeinit
CCcut_GHtreeprint

CUT/cut_st.c

CCcut_mincut_st

CUT/connect.c

CCcut_connect_components

COMBS/dngreedy.c

CCcombs_greedy_cut
CCcombs_GC_build_graph
CCcombs_GC_init_graph
CCcombs_GC_free_graph

COMBS/block.c

CCcombs_find_blocks

LOCALCUT/lift.c

CCchunk_lift
CCchunk_ineq_to_lpcut_in
CCchunk_ineq_to_cut

LOCALCUT/chunks.c

CCchunk_finder

LOCALCUT/tsporacl.c

CCchunk_oracle
CCchunk_verify

LOCALCUT/first.c

CCchunk_separate
CCchunk_graph_alloc
CCchunk_graph_free

LOCALCUT/intmat.c

CCchunk_intmat_build
CCchunk_intmat_addrow
CCchunk_intmat_ortho
CCchunk_intmat_init
CCchunk_intmat_free
CCchunk_intmat_dellastrows

LOCALCUT/separate.c

CCchunk_lpinit
CCchunk_lpfree
CCchunk_lpaddcol
CCchunk_lprelaxrow
CCchunk_lpsolve
CCchunk_lpbasis

BIGGUY/bigguy.c

CCbigguy_swrite
CCbigguy_sread
CCbigguy_addmult
CCbigguy_cmp
CCbigguytod
CCbigguy_itobigguy
CCbigguy_dtobigguy
CCbigguy_ceil

VERIFY/verify.c

CCverify_cut
CCverify_classify
CCverify_initcutclass
CCverify_freecutclass

UTIL/edgemap.c

CCutil_edgehash_init
CCutil_edgehash_add
CCutil_edgehash_set
CCutil_edgehash_del
CCutil_edgehash_find
CCutil_edgehash_getall
CCutil_edgehash_delall
CCutil_edgehash_free

TSP/tighten.c

CCtsp_tighten_lpcut_in
CCtsp_tighten_lpcut
CCtsp_init_tighten_info
CCtsp_print_tighten_info

TINY/tinytsp.c

CCtiny_bnc_tsp
CCtiny_bnc_msp

TINY/bnbtsp.c

CCtiny_bnb_tsp

TINY/bnbmsp.c

CCtiny_bnb_msp

TINY/benttsp.c

CCtiny_benttsp_elist

UTIL/profrus.c

CCprof_init
CCprof_start
CCprof_stop
CCprof_end

LOCALCUT/localcut.c

CCchunk_localcuts

LOCALCUT/first.c

CCchunk_init_separate_timer
CCchunk_init_find_timer
CCchunk_init_lift_timer
CCchunk_init_oracle_timer
CCchunk_init_localcut_timer
CCchunk_print_separate_timer
CCchunk_print_find_timer
CCchunk_print_lift_timer
CCchunk_print_oracle_timer
CCchunk_print_localcut_timer

PQ/cuttree.c

CCpq_cuttree_init
CCpq_cuttree_freetree
CCpq_check_clique
CCpq_cuttree_display
CCpq_cuttree_describe
CCpq_cuttree_trivial
CCpq_cuttree_update_clean
CCpq_cuttree_improve_quick
CCpq_apply_clique
CCpq_cuttree_gen_cliques
CCpq_cuttree_build_necklaces

INCLUDE/util.h

CC_SAFE_MALLOC - allocate memory, and output error message if out of memory.
CC_FREE - free memory
CC_IFFREE - free memory if pointer is non-NULL
CC_PTR_ALLOC_ROUTINE - create a routine to allocate a pointer object
CC_PTR_FREE_ROUTINE - create a routine to free a pointer object
CC_PTR_FREE_LIST_ROUTINE - create a routine to free a list of pointer objects
CC_PTR_FREE_WORLD_ROUTINE - create a routine to free a pointer allocation world
CC_PTR_LEAKS_ROUTINE - create a routine to check a pointer allocation world for leaks
CC_PTR_STATUS_ROUTINE - create a routine to check the status of a pointer allocation world

INCLUDE/pqsets.h

CCpq_set_INIT
CCpq_set_ISEMPTY
CCpq_set_SIZE
CCpq_set_PTR_TO
CCpq_set_PTR_REPLACE
CCpq_set_PTR_AWAY
CCpq_set_ADD_WORK
CCpq_set_ADD_LEFT
CCpq_set_ADD_RIGHT
CCpq_set_ADD
CCpq_set_DELETE
CCpq_set_DELETE2
CCpq_set_LEFT_ELEM
CCpq_set_RIGHT_ELEM
CCpq_set_FOREACH
CCpq_set_FOREACH_FROM
CCpq_set_FOREACH_DEL
CCpq_set_FOREACH_ADJ

INCLUDE/macrorus.h

CC_SWAP - swap two variables
CC_OURABS - absolute value