#include <stdio.h>#include <stdlib.h>#include <math.h>#include "eg_timer.h"#include "eg_mempool.h"#include "eg_list.h"#include "eg_heap.h"#include "eg_dgraph.h"#include "eg_dijkstra.h"#include "eg_dijkstra_app.h"#include "eg_ddomino.h"#include "eg_ddpconstraint.h"Include dependency graph for eg_greedytypes.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | EGgreedyData_t |
| struct | 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. More... | |
| struct | EGinternalPairs_t |
| struct | EGdkdomino_t |
| struct | EGdkpc_t |
| struct | EGdcutIter_t |
| struct | EGpkpc_t |
| struct | EGcutSeed_t |
Defines | |
| #define | KP_DEBUG 0 |
| #define | EG_DEBUG_TRACE 0 |
| #define | EG_KP_NOST 0xfff |
| #define | EG_KP_MAX_CUTS 250 |
| #define | EG_USE_ZERO_DOMINOES 1 |
| #define | EG_USE_KARGER 1 |
| #define | EG_KP_HEURISTIC 1 |
| #define | EG_GREEDYKP_FILLTABLE 1 |
| #define | EG_USE_SAMPLING 1 |
| #define | EG_KP_SAMPLE_TIME 1.0 |
| #define | EG_KP_MAX_SAMPLE 10 |
| #define | EG_KP_SAMPLE_SEED 1 |
| #define | EG_DOMINO_K 2 |
| #define | EG_KPC_MAX_HANDLES 5 |
| #define | EG_KARGER_SEED 1 |
| #define | EG_KARGER_MAX_ITER INT_MAX |
| #define | EG_KARGER_MAX_TOT_TIME 15.0 |
| #define | EG_KARGER_TIME_PER_NODE 0.3 |
Typedefs | |
| typedef EGdualCut_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. | |
| typedef EGinternalPairs_t | EGinternalPairs_t |
| typedef EGdkdomino_t | EGdkdomino_t |
Functions | |
| void | EGfreeInternalPairs (void *pair, EGmemPool_t *mem) |
| destructor for greedytypes | |
| void | EGdisplayDualCut (FILE *fout, EGdualCut_t *dc) |
| int | EGincreaseDKdomino (EGdkdomino_t *dkd, EGinternalPairs_t *p) |
|
|
Definition at line 20 of file eg_greedytypes.h. |
|
|
Definition at line 77 of file eg_greedytypes.h. |
|
|
Definition at line 47 of file eg_greedytypes.h. |
|
|
Definition at line 97 of file eg_greedytypes.h. |
|
|
Definition at line 104 of file eg_greedytypes.h. |
|
|
Definition at line 89 of file eg_greedytypes.h. |
|
|
Definition at line 105 of file eg_greedytypes.h. |
|
|
Definition at line 46 of file eg_greedytypes.h. |
|
|
Definition at line 22 of file eg_greedytypes.h. |
|
|
Definition at line 64 of file eg_greedytypes.h. |
|
|
Definition at line 21 of file eg_greedytypes.h. |
|
|
Definition at line 68 of file eg_greedytypes.h. |
|
|
Definition at line 63 of file eg_greedytypes.h. |
|
|
Definition at line 83 of file eg_greedytypes.h. |
|
|
Definition at line 38 of file eg_greedytypes.h. |
|
|
Definition at line 48 of file eg_greedytypes.h. |
|
|
Definition at line 30 of file eg_greedytypes.h. |
|
|
Definition at line 19 of file eg_greedytypes.h. |
|
|
Generic form for dual k-dominos |
|
|
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.
|
|
|
|
|
||||||||||||
|
Definition at line 947 of file eg_greedykp.c. |
|
||||||||||||
|
destructor for greedytypes
Definition at line 336 of file eg_kppairs.c. |
|
||||||||||||
|
|
1.4.5