#include <stdlib.h>#include <stdio.h>#include <math.h>#include "cookInterface.h"#include "eg_mempool.h"#include "eg_list.h"#include "eg_dgraph.h"#include "eg_ugraph.h"#include "eg_equiset.h"#include "eg_bit.h"#include "eg_dijkstra.h"#include "eg_menger.h"#include "eg_menger_app.h"#include "bc_spanning.h"#include "eg_util.h"#include "dp_config.h"#include "graph_boyer.h"Include dependency graph for graphdual.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Defines | |
| #define | GD_LEVEL 9 |
Functions | |
| int | isPlanarBoyer (int nnodes, int nedges, int *edges) |
| int | isPlanarOrMinorBoyer (int nnodes, int nedges, int *edges, int *nmedges, int *medges) |
| EGdGraph_t * | getDualBoyer (graphP G, int nnodes, int nedges, double *weigh, EGlist_t ***dembed, EGmemPool_t *localmem, EGlist_t ***lembed) |
| int | DPfindBadEdge (int nnodes, int nedges, int *edges, double *weight) |
| int | DPfindBadEdgeK (int nnodes, int nedges, int *edges, double *weight, int k) |
| int | DPedgeEliminationHeuristic (int nnodes, int nedges, int *edges, double *weight, int *nplanar_edges, int *planar_edges, double *planar_weight, int *nelim_indices, int *elim_indices) |
| int | DPbinPlanarizeBoyer (int nnodes, int nedges1, int nedges2, int *edges, double *weigh, int *nedges3, int *edges3, double *weigh3, int *elim_indices) |
| int | DPgetMinorNodesToContract (int nnodes, int nedges, int *edges, int *node_1, int *node_2) |
| int | DPgetNonMinorNodesToContract (int nnodes, int nedges, int *edges, double *weight, int *node_1, int *node_2) |
| int | DPgetTrivialNodesToContract (int nnodes, int nedges, int *edges, double *weight, int *node_1, int *node_2) |
| int | DPfastEdgeEliminationHeuristic (int nnodes, int nedges1, int *edges, double *weight, int *nedges2, int *edges2, double *weight2, int *nelim, int *elim_indices, int k_param) |
| int | DPfindBadBinEdge (int nnodes, int nedges, int *edges) |
| int | DPfindBadBinEdgeK (int nnodes, int nedges, int *edges, double *weight, int k) |
| int | DPgetBinMinor (int nnodes, int nedges, int *edges, int *nmedges, int *medges, int k) |
|
|
Definition at line 22 of file graphdual.h. |
|
||||||||||||||||||||||||||||||||||||||||
|
Definition at line 487 of file graphdual.c. |
|
||||||||||||||||||||||||||||||||||||||||
|
Definition at line 379 of file graphdual.c. |
|
||||||||||||||||||||||||||||||||||||||||||||
|
Definition at line 1070 of file graphdual.c. |
|
||||||||||||||||
|
Definition at line 1166 of file graphdual.c. |
|
||||||||||||||||||||||||
|
Definition at line 1220 of file graphdual.c. |
|
||||||||||||||||||||
|
Definition at line 1026 of file graphdual.c. |
|
||||||||||||||||||||||||
|
Definition at line 952 of file graphdual.c. |
|
||||||||||||||||||||||||||||
|
Definition at line 1273 of file graphdual.c. |
|
||||||||||||||||||||||||
|
Definition at line 854 of file graphdual.c. |
|
||||||||||||||||||||||||||||
|
Definition at line 685 of file graphdual.c. |
|
||||||||||||||||||||||||||||
|
Definition at line 646 of file graphdual.c. |
|
||||||||||||||||||||||||||||||||
|
Definition at line 115 of file graphdual.c. |
|
||||||||||||||||
|
Definition at line 421 of file graphdual.c. |
|
||||||||||||||||||||||||
|
Definition at line 443 of file graphdual.c. |
1.4.5