Concorde function alphabetic index

Organizational index     Program index     Macro index     Data Types index    

CCbigguy_addmult
CCbigguy_ceil
CCbigguy_cmp
CCbigguy_dtobigguy
CCbigguy_itobigguy
CCbigguy_sread
CCbigguy_swrite
CCbigguytod
CCcombs_GC_build_graph
CCcombs_GC_free_graph
CCcombs_GC_init_graph
CCcombs_find_blocks
CCcombs_greedy_cut
CCpq_consecutiveones
CCcut_GHtreefree
CCcut_GHtreeinit
CCcut_GHtreeprint
CCcut_SRK_buildgraph
CCcut_SRK_defluff
CCcut_SRK_expand
CCcut_SRK_free_expinfo
CCcut_SRK_free_graph
CCcut_SRK_grab_edges
CCcut_SRK_grab_nodes
CCcut_SRK_identify_nodes
CCcut_SRK_identify_one_square
CCcut_SRK_identify_one_triangles
CCcut_SRK_identify_ones
CCcut_SRK_identify_paths
CCcut_SRK_identify_paths_to_edges
CCcut_SRK_identify_pr_edges
CCcut_SRK_identify_tight_squares
CCcut_SRK_identify_tight_triangles
CCcut_SRK_identify_triangle_square
CCcut_SRK_increment_marker
CCcut_SRK_init_callback
CCcut_SRK_init_expinfo
CCcut_SRK_init_graph
CCcut_SRK_original_ncount
CCcut_SRK_set_mark
CCcut_SRK_subtour_shrink
CCcut_SRK_trivial
CCcut_connect_components
CCcut_gomory_hu
CCcut_linsub
CCcut_linsub_allcuts
CCcut_mincut
CCcut_mincut_st
CCcut_violated_cuts
CCpq_apply_clique
CCpq_check_clique
CCpq_cuttree_build_necklaces
CCpq_cuttree_describe
CCpq_cuttree_display
CCpq_cuttree_freetree
CCpq_cuttree_gen_cliques
CCpq_cuttree_improve_quick
CCpq_cuttree_init
CCpq_cuttree_trivial
CCpq_cuttree_update_clean
CCedgegen_delaunay
CCedgegen_edges
CCedgegen_init_edgegengroup
CCedgegen_junk_k_nearest
CCedgegen_junk_nearest_neighbor_tour
CCedgegen_junk_node_k_nearest
CCedgegen_junk_node_nearest
CCedgegen_read
CCedgegen_x_k_nearest
CCedgegen_x_nearest_neighbor_tour
CCedgegen_x_node_k_nearest
CCedgegen_x_node_nearest
CCedgegen_x_node_quadrant_k_nearest
CCedgegen_x_quadrant_k_nearest
CCedgegen_xnear_build
CCedgegen_xnear_free
CCfmatch_fractional_2match
CCheldkarp_small
CCheldkarp_small_elist
CCkdtree_3opt_tour
CCkdtree_boruvka_tour
CCkdtree_build
CCkdtree_delete
CCkdtree_delete_all
CCkdtree_far_add_tour
CCkdtree_fixed_radius_nearest
CCkdtree_free
CCkdtree_greedy_tour
CCkdtree_k_nearest
CCkdtree_nearest_neighbor_2match
CCkdtree_nearest_neighbor_tour
CCkdtree_node_k_nearest
CCkdtree_node_nearest
CCkdtree_node_quadrant_k_nearest
CCkdtree_prim_spanningtree
CCkdtree_qboruvka_tour
CCkdtree_quadrant_k_nearest
CCkdtree_twoopt_tour
CCkdtree_undelete
CCkdtree_undelete_all
CClinkern_flipper_cycle
CClinkern_flipper_finish
CClinkern_flipper_flip
CClinkern_flipper_init
CClinkern_flipper_next
CClinkern_flipper_prev
CClinkern_flipper_sequence
CClinkern_tour
CCchunk_finder
CCchunk_graph_alloc
CCchunk_graph_free
CCchunk_ineq_to_cut
CCchunk_ineq_to_lpcut_in
CCchunk_init_find_timer
CCchunk_init_lift_timer
CCchunk_init_localcut_timer
CCchunk_init_oracle_timer
CCchunk_init_separate_timer
CCchunk_intmat_addrow
CCchunk_intmat_build
CCchunk_intmat_dellastrows
CCchunk_intmat_free
CCchunk_intmat_init
CCchunk_intmat_ortho
CCchunk_lift
CCchunk_localcuts
CCchunk_lpaddcol
CCchunk_lpbasis
CCchunk_lpfree
CCchunk_lpinit
CCchunk_lprelaxrow
CCchunk_lpsolve
CCchunk_oracle
CCchunk_print_find_timer
CCchunk_print_lift_timer
CCchunk_print_localcut_timer
CCchunk_print_oracle_timer
CCchunk_print_separate_timer
CCchunk_separate
CCchunk_verify
CClp_addcols
CClp_addrows
CClp_build_warmstart
CClp_change_sense
CClp_create
CClp_create_info
CClp_delete_column
CClp_delete_row
CClp_delete_set_of_columns
CClp_delete_set_of_rows
CClp_disable_presolve
CClp_dump_lp
CClp_force_perturb
CClp_free
CClp_free_info
CClp_free_warmstart
CClp_freelp
CClp_get_info
CClp_get_warmstart
CClp_getgoodlist
CClp_getweight
CClp_init
CClp_is_col_active
CClp_is_row_active
CClp_limited_dualopt
CClp_load_warmstart
CClp_loadlp
CClp_ncols
CClp_new_row
CClp_nnonzeros
CClp_nrows
CClp_objval
CClp_opt
CClp_pi
CClp_pivotin
CClp_pivotout
CClp_rc
CClp_set_col_active
CClp_set_col_inactive
CClp_set_col_upper
CClp_set_row_active
CClp_set_row_inactive
CClp_setbnd
CClp_sread_warmstart
CClp_status
CClp_strongbranch
CClp_swrite_warmstart
CClp_tune_small
CClp_x
CCedgegen_mlinkern
CCpq_necklaces
CCpq_apply
CCpq_check
CCpq_cuttree_to_pq
CCpq_describe_solution
CCpq_dump_solution
CCpq_find_root
CCpq_tree_free
CCpq_tree_init
CCpq_tree_trivial
CCprof_end
CCprof_init
CCprof_start
CCprof_stop
CCtiny_benttsp_elist
CCtiny_bnb_msp
CCtiny_bnb_tsp
CCtiny_bnc_msp
CCtiny_bnc_tsp
CCtsp_add_branchhistory_to_lp
CCtsp_add_cut
CCtsp_add_cut_to_cutlist
CCtsp_add_cuts_to_queue
CCtsp_add_multiple_rows
CCtsp_add_nodes_to_lpclique
CCtsp_add_nzlist_to_lp
CCtsp_add_to_cutpool
CCtsp_add_to_cutpool_lpcut_in
CCtsp_add_vars_to_lp
CCtsp_addbad_variables
CCtsp_array_to_lpclique
CCtsp_array_to_subtour
CCtsp_bb_cutting
CCtsp_bb_find_branch
CCtsp_bb_init_lp - short from of CCtsp_init_lp for use in branch and bound
CCtsp_bb_splitprob
CCtsp_bfs_brancher
CCtsp_bfs_restart
CCtsp_block_combs
CCtsp_blossom_loop
CCtsp_branch_cutpool_cliques
CCtsp_build_lpadj
CCtsp_build_lpgraph
CCtsp_buildcut_abort
CCtsp_buildcut_addclique
CCtsp_buildcut_begin
CCtsp_buildcut_finish
CCtsp_call_x_heuristic
CCtsp_check_integral
CCtsp_clique_count
CCtsp_clique_delta
CCtsp_clique_eq
CCtsp_clique_marked_count
CCtsp_clique_to_array
CCtsp_cliquetree_lp
CCtsp_comb_handling
CCtsp_comb_to_cliquetree
CCtsp_comb_to_double_decker
CCtsp_comb_to_star
CCtsp_compare_skeletons
CCtsp_connect_cuts
CCtsp_construct_skeleton
CCtsp_copy_cuts
CCtsp_copy_lpclique
CCtsp_copy_lpcut_in
CCtsp_copy_skeleton
CCtsp_create_lpcliques
CCtsp_cutprice
CCtsp_cutselect_set_tols
CCtsp_cutting_loop
CCtsp_delete_cut
CCtsp_delete_cut_from_cutlist
CCtsp_delete_nodes_from_lpclique
CCtsp_display_cutpool
CCtsp_do_interactive_branch
CCtsp_double_decker_lp
CCtsp_dump_x
CCtsp_dumptour
CCtsp_easy_dfs_brancher
CCtsp_edge_comb_grower
CCtsp_edge_elimination
CCtsp_edgelist_to_genadj
CCtsp_eliminate_variables
CCtsp_exact_dual
CCtsp_exact_price
CCtsp_exact_subtours
CCtsp_exactblossom
CCtsp_execute_branch
CCtsp_execute_unbranch
CCtsp_fastblossom
CCtsp_file_cuts
CCtsp_file_cuts_write
CCtsp_find_branch
CCtsp_find_branch_cliques
CCtsp_find_branch_edge
CCtsp_find_edge
CCtsp_find_pure_handle
CCtsp_free_branchobj
CCtsp_free_cliquehash
CCtsp_free_cutpool
CCtsp_free_edgegenerator
CCtsp_free_lpclique
CCtsp_free_lpcut_in
CCtsp_free_lpgraph
CCtsp_free_lprow
CCtsp_free_qsparsify
CCtsp_free_skeleton
CCtsp_free_tsp_lp_struct - free a CCtsp_lp
CCtsp_generate_edges
CCtsp_get_clique
CCtsp_get_clique_prices
CCtsp_get_lp_result
CCtsp_ghfastblossom
CCtsp_grunt
CCtsp_handling_lp
CCtsp_handling_lp
CCtsp_hashclique
CCtsp_infeas_recover
CCtsp_init_branchobj
CCtsp_init_cliquehash
CCtsp_init_cutpool
CCtsp_init_cutselect
CCtsp_init_edgegenerator
CCtsp_init_lp - build/read an initial problem in a CCtsp_lp
CCtsp_init_lpclique
CCtsp_init_lpcut_in
CCtsp_init_lpgraph_struct
CCtsp_init_lprow
CCtsp_init_skeleton
CCtsp_init_tentative_cutselect
CCtsp_init_tighten_info
CCtsp_init_tsp_lp_struct - initialize a CCtsp_lp
CCtsp_inspect_full_edges
CCtsp_is_clique_marked
CCtsp_lpclique_compare
CCtsp_lpcut_in_nzlist
CCtsp_lpcut_to_lpcut_in
CCtsp_mark_clique
CCtsp_mark_clique_and_neighbors
CCtsp_mark_clique_and_neighbors_double
CCtsp_mark_cut
CCtsp_mark_cut_and_neighbors
CCtsp_max_node
CCtsp_pr_cliquetree
CCtsp_price_cuts
CCtsp_price_cuts_threaded
CCtsp_pricing_loop
CCtsp_print_branchhistory
CCtsp_print_lpclique
CCtsp_print_lpcut_in
CCtsp_print_tighten_info
CCtsp_prob_copy_section
CCtsp_prob_delete_remote
CCtsp_prob_file_delete
CCtsp_prob_getchildren
CCtsp_prob_getcuts
CCtsp_prob_getedges
CCtsp_prob_getexactdual
CCtsp_prob_getexactlb
CCtsp_prob_getfixed
CCtsp_prob_getfulladj
CCtsp_prob_gethistory
CCtsp_prob_getid
CCtsp_prob_getinfeasible
CCtsp_prob_getlb
CCtsp_prob_getname
CCtsp_prob_getnnodes
CCtsp_prob_getparent
CCtsp_prob_getprocessed
CCtsp_prob_getreal
CCtsp_prob_gettour
CCtsp_prob_getub
CCtsp_prob_getwarmstart
CCtsp_prob_putchildren
CCtsp_prob_putcuts
CCtsp_prob_putedges
CCtsp_prob_putexact_dual
CCtsp_prob_putexactlb
CCtsp_prob_putfixed
CCtsp_prob_putfulladj
CCtsp_prob_puthistory
CCtsp_prob_putid
CCtsp_prob_putinfeasible
CCtsp_prob_putlb
CCtsp_prob_putname
CCtsp_prob_putnnodes
CCtsp_prob_putparent
CCtsp_prob_putprocessed
CCtsp_prob_putreal
CCtsp_prob_puttour
CCtsp_prob_putub
CCtsp_prob_putwarmstart
CCtsp_prob_rclose
CCtsp_prob_read
CCtsp_prob_read_name
CCtsp_prob_read_remote
CCtsp_prob_server
CCtsp_prob_wclose
CCtsp_prob_write
CCtsp_prob_write_name
CCtsp_prob_write_remote
CCtsp_problabel
CCtsp_process_cuts
CCtsp_qsparsify
CCtsp_read_cuts
CCtsp_read_lpclique
CCtsp_read_lpcut_in
CCtsp_read_probfile
CCtsp_read_probfile_id
CCtsp_read_skeleton
CCtsp_register_clique
CCtsp_register_cliques
CCtsp_reset_edgegenerator
CCtsp_resparsify_lp
CCtsp_search_cutpool
CCtsp_search_cutpool_cliques
CCtsp_search_remotepool
CCtsp_seglist_to_lpclique
CCtsp_segment_cuts
CCtsp_segment_to_subtour
CCtsp_send_newcuts
CCtsp_shrunk_set_to_lpclique
CCtsp_solve_dat
CCtsp_solve_sparse
CCtsp_splitprob
CCtsp_star_lp
CCtsp_subtour_and_blossom_loop
CCtsp_subtour_loop
CCtsp_teething
CCtsp_teething_list
CCtsp_teething_lp
CCtsp_test_cut_branch
CCtsp_test_pseudocomb
CCtsp_test_pure_comb
CCtsp_test_pure_double_decker
CCtsp_test_pure_simple_cliquetree
CCtsp_test_teeth_disjoint
CCtsp_tighten_lp
CCtsp_tighten_lpcut
CCtsp_tighten_lpcut_in
CCtsp_unregister_clique
CCtsp_unregister_cliques
CCtsp_update_result
CCtsp_verify_infeasible_lp
CCtsp_verify_lp_prune
CCtsp_write_cutpool
CCtsp_write_cuts
CCtsp_write_lpclique
CCtsp_write_lpcut
CCtsp_write_lpcut_in
CCtsp_write_probfile_id
CCtsp_write_probfile_sav
CCtsp_write_probroot_id
CCtsp_write_skeleton
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
CCelist_alloc - allocate space for a CCelist
CCelist_free - free a CCelist
CCelist_init - initialize a CCelist
CCelistl_alloc - allocate space for a CCelistl
CCelistl_free - free a CCelistl
CCelistl_init - initialize a CCelistl
CCelistlw_alloc - CCelistlw
CCelistlw_free - free a CCelistlw
CCelistlw_init - initialize a CCelistlw
CCelistw_alloc - allocate space for a CCelistw
CCelistw_free - free a CCelistw
CCelistw_init - initialize a CCelistw
CCptrworld_add - add a reference to a CCptrworld
CCptrworld_delete - delete a reference to a ptrworld, and free if no more references
CCptrworld_init - initialize a CCptrworld with 1 reference
CCutil_allocrus - allocate a block of memory
CCutil_bigchunkalloc - allocate a CCbigchunk
CCutil_bigchunkfree - free a CCbigchunk
CCutil_bix_getopt - parse an argument list
CCutil_copy_datagroup - copy a CCdatagroup
CCutil_cycle_len - compute the length of a tour
CCutil_dat_edgelen - compute the length of an edge
CCutil_dat_getnorm - get the norm of a CCdatagroup
CCutil_dat_setnorm - set the norm for a CCdatagroup
CCutil_datagroup_perm - permute a CCdatagroup
CCutil_dheap_changekey - change the key of an entry in 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_findmin - find the minimum entry in a d-heap
CCutil_dheap_free - free a d-heap
CCutil_dheap_init - initialize a d-heap
CCutil_dheap_insert - insert an entry into a d-heap
CCutil_dheap_resize - resize a d-heap
CCutil_double_perm_quicksort - quick-sort a permutation of doubles
CCutil_dsjrand_init - initialize the dsjrand norm
CCutil_edge_file_union - read several edge lists and merge the results
CCutil_edge_to_cycle - convert an edge list to a cycle
CCutil_edgehash_add
CCutil_edgehash_del
CCutil_edgehash_delall
CCutil_edgehash_find
CCutil_edgehash_free
CCutil_edgehash_getall
CCutil_edgehash_init
CCutil_edgehash_set
CCutil_freedatagroup - free a CCdatagroup
CCutil_freerus - free a block of memory
CCutil_genedgelist - generate a random edge list
CCutil_genhash_delete - delete an entry from a generic hash table
CCutil_genhash_delete_h - delete an entry from a generic hash table (given the hash value)
CCutil_genhash_free - free a generic hash table
CCutil_genhash_hash - compute the hash function of a key in a generic hash table
CCutil_genhash_init - initialize a generic hash table
CCutil_genhash_insert - insert an entry into a generic hash table
CCutil_genhash_insert_h - insert an entry into a generic hash table (given the hash value)
CCutil_genhash_lookup - look up an entry in a generic hash table
CCutil_genhash_lookup_h - look up an entry in a generic hash table (given the hash value)
CCutil_genhash_next - move the iterator over a generic hash table to the next element
CCutil_genhash_replace - replace an entry in a generic hash table
CCutil_genhash_replace_h - replace 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_u_data - change the user data stored with a generic hash table
CCutil_get_sparse_dat_edges - convert a CCdatagroup of norm CC_SPARSE to a sparse edge list
CCutil_getcycle - read a cycle in permutation format
CCutil_getcycle_edgelist - read a cycle in edge list format
CCutil_getdata - build (by reading or generating) a CCdatagroup for computing edge lengths
CCutil_getedgelist - read an edgelist, verifying ncount
CCutil_getedgelist_n - read an edgelist, reading ncount
CCutil_getedges_double - read an edgelist with floating-point lengths
CCutil_getmaster - read a problem master file
CCutil_getnodeweights - read (or generate) node weights
CCutil_gettsplib - read a TSPLIB instance
CCutil_graph2dat_matrix - convert a matrix of edge lengths to a CCdatagroup
CCutil_graph2dat_sparse - convert a sparse edge list to a CCdatagroup
CCutil_handler_exit - signal handler which outputs a message and exits
CCutil_handler_fatal - signal handler which outputs an error message, waits, then exits
CCutil_handler_warn - signal handler which outputs a warning message
CCutil_init_datagroup - initialize a CCdatagroup
CCutil_init_timer - initialize a timer
CCutil_int_array_quicksort - quick-sort an integer array
CCutil_int_perm_quicksort - quick-sort a permutation of integers
CCutil_linked_radixsort - radix-sort a linked list
CCutil_lprand - get a random integer from the portable random number generator
CCutil_nextprime - find the next larger prime
CCutil_normrand - get a normally distributed random variable
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_printlabel - print information identifying the host computer
CCutil_priority_changekey - change the key of an entry in 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_findmin - find the minimum in a priority queue
CCutil_priority_free - free a priority queue
CCutil_priority_init - initialize a priority queue
CCutil_priority_insert - insert an entry into a priority queue
CCutil_putmaster - write a problem master file
CCutil_readint - read an integer quickly
CCutil_readmaster - read the problem master data from a CC_SFILE
CCutil_readstr - read a string, terminated by whitespace or EOF
CCutil_real_zeit - measure real time
CCutil_reallocrus - change the size of an allocated block of memory
CCutil_reallocrus_count - change the size of an allocated block of memory to a specified count
CCutil_reallocrus_scale - change the size of an allocated block of memory by a scale factor
CCutil_resume_timer - resume a suspended timer
CCutil_rselect - divide a permutation of integers into the m smallest and the rest
CCutil_sbits - compute the number of bits necessary to represent an integer
CCutil_sclose - close a CC_SFILE
CCutil_sdelete_file - delete a file
CCutil_sdelete_file_backup - delete the backup file created by a CCutil_sopen
CCutil_sdopen - open a descriptor for buffered binary I/O (CC_SFILE)
CCutil_sflush - flush the buffers of a CC_SFILE
CCutil_sig_to_ccsig - map O/S signal numbers to concorde signal numbers
CCutil_signal_default - restore the default handler for a signal
CCutil_signal_handler - specify a handler for a signal
CCutil_signal_ignore - ignores (blocks) a signal
CCutil_signal_init - initialize signal handling functions to the defaults
CCutil_snet_listen - listen for network CC_SFILE connections
CCutil_snet_open - open a network CC_SFILE connection
CCutil_snet_receive - receive a network CC_SFILE connection
CCutil_snet_unlisten - quit listening for network CC_SFILE connections
CCutil_sopen - open a file for buffered binary I/O (CC_SFILE)
CCutil_sparse_real_tour - check to see if every edge in a cycle is in a CC_SPARSE datagroup
CCutil_sparse_strip_edges - remove the artifical edges from an edge list
CCutil_sprand - initialize the portable random number generator
CCutil_sread - read data from a CC_SFILE
CCutil_sread_bits - read bits from a CC_SFILE
CCutil_sread_char - read a char 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_sread_int - read an int from a CC_SFILE
CCutil_sread_int_r - read a reversed int from a CC_SFILE
CCutil_sread_short - read a short from a CC_SFILE
CCutil_sread_short_r - read a reversed short from a CC_SFILE
CCutil_sread_string - read a string from a CC_SFILE
CCutil_sread_ubits - read unsigned bits from a CC_SFILE
CCutil_sread_uint - read an unsigned int from a CC_SFILE
CCutil_sread_ushort - read an unsigned short from a CC_SFILE
CCutil_srewind - rewind a CC_SFILE
CCutil_sseek - set the location in a CC_SFILE
CCutil_start_timer - start a timer running
CCutil_stell - report the current location in a CC_SFILE
CCutil_stop_timer - stop a timer
CCutil_strchr - search a string for a character
CCutil_strchr_c - search a constant string for a character
CCutil_strdup - duplicate a string, allocating space for the copy
CCutil_strdup2 - duplicate a string, stopping at the first whitespace
CCutil_strrchr - search a string backwards for a character
CCutil_strrchr_c - search a constant string backwards for a character
CCutil_suspend_timer - suspend a timer
CCutil_swrite - write data to a CC_SFILE
CCutil_swrite_bits - write bits to a CC_FILE
CCutil_swrite_char - write a char to a CC_SFILE
CCutil_swrite_double - write a double to a CC_SFILE
CCutil_swrite_int - write an int to a CC_SFILE
CCutil_swrite_short - write a short to a CC_SFILE
CCutil_swrite_string - write a string to a CC_SFILE
CCutil_swrite_ubits - write unsigned bits to a CC_SFILE
CCutil_swrite_uint - write an unsigned int to a CC_SFILE
CCutil_swrite_ushort - write an unsigned short to a CC_SFILE
CCutil_total_timer - get the total time in a timer
CCutil_tri2dat - convert an upper triangular matrix of edge lengths to a CCdatagroup
CCutil_writecycle - write a cycle in permutation format
CCutil_writecycle_edgelist - write a cycle in edgelist format
CCutil_writeedges - write an edgelist
CCutil_writeedges_double - write an edgelist, specifying the lengths in floating point
CCutil_writeedges_int - write an edgelist, specifying the lengths
CCutil_writemaster - write the problem master data to a CC_SFILE
CCutil_writetsplib - write a TSPLIB instance
CCutil_zeit - measure cpu time
CCverify_classify
CCverify_cut
CCverify_freecutclass
CCverify_initcutclass