libs/ck-libs/metis/libmetis/compress.c File Reference

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

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.

References graph_t::adjncy, graph_t::adjwgt, CreateGraph(), ctrl_t::dbglvl, gk_free(), ikvsorti(), key, PUP::l, METIS_DBG_INFO, graph_t::ncon, graph_t::nedges, graph_t::nvtxs, SetupGraph_label(), SetupGraph_tvwgt(), graph_t::vwgt, and graph_t::xadj.

Referenced by METIS_NodeND(), and METIS_NodeNDP().

Here is the call graph for this function:

Here is the caller graph for this function:

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.

References graph_t::adjncy, graph_t::adjwgt, CreateGraph(), ctrl_t::dbglvl, gk_free(), PUP::l, METIS_DBG_INFO, graph_t::ncon, graph_t::nedges, graph_t::nvtxs, perm, SetupGraph_label(), SetupGraph_tvwgt(), graph_t::vwgt, and graph_t::xadj.

Referenced by METIS_NodeND().

Here is the call graph for this function:

Here is the caller graph for this function: