#include "metislib.h"
Include dependency graph for compress.c:
Go to the source code of this file.
Functions | |
| graph_t * | CompressGraph (ctrl_t *ctrl, idx_t nvtxs, idx_t *xadj, idx_t *adjncy, idx_t *vwgt, idx_t *cptr, idx_t *cind) |
| graph_t * | PruneGraph (ctrl_t *ctrl, idx_t nvtxs, idx_t *xadj, idx_t *adjncy, idx_t *vwgt, idx_t *iperm, real_t factor) |
Function Documentation
◆ CompressGraph()
| graph_t* CompressGraph | ( | ctrl_t * | ctrl, |
| idx_t | nvtxs, | ||
| idx_t * | xadj, | ||
| idx_t * | adjncy, | ||
| idx_t * | vwgt, | ||
| idx_t * | cptr, | ||
| idx_t * | cind | ||
| ) |
This function compresses a graph by merging identical vertices The compression should lead to at least 10% reduction.
The compressed graph that is generated has its adjwgts set to 1.
- Returns
- 1 if compression was performed, otherwise it returns 0.
Definition at line 25 of file compress.c.
◆ PruneGraph()
| graph_t* PruneGraph | ( | ctrl_t * | ctrl, |
| idx_t | nvtxs, | ||
| idx_t * | xadj, | ||
| idx_t * | adjncy, | ||
| idx_t * | vwgt, | ||
| idx_t * | iperm, | ||
| real_t | factor | ||
| ) |
This function prunes all the vertices in a graph with degree greater than factor*average.
- Returns
- the number of vertices that were prunned.
Definition at line 150 of file compress.c.