Go to the documentation of this file.
22 int main(
int argc,
char *argv[])
25 char *curptr, *newptr;
43 printf(
"***The input graph is not contiguous.\n"
44 "***The specified -contig option will be ignored.\n");
55 errexit(
"Error parsing entry #%"PRIDX" of ubvec [%s] (possibly missing).\n",
62 if (
params->iptype == -1) {
112 printf(
"***It seems that Metis did not free all of its memory! Report this.\n");
118 printf(
"\n***Metis returned with an error.\n");
146 if (
params->ufactor == -1) {
149 else if (
graph->ncon == 1)
155 printf(
"******************************************************************************\n");
157 printf(
" (HEAD: %s, Built on: %s, %s)\n", SVNINFO, __DATE__, __TIME__);
158 printf(
" size of idx_t: %zubits, real_t: %zubits, idx_t *: %zubits\n",
161 printf(
"Graph Information -----------------------------------------------------------\n");
162 printf(
" Name: %s, #Vertices: %"PRIDX", #Edges: %"PRIDX", #Parts: %"PRIDX"\n",
165 printf(
" Balancing constraints: %"PRIDX"\n",
graph->ncon);
168 printf(
"Options ---------------------------------------------------------------------\n");
169 printf(
" ptype=%s, objtype=%s, ctype=%s, rtype=%s, iptype=%s\n",
173 printf(
" dbglvl=%"PRIDX", ufactor=%.3f, no2hop=%s, minconn=%s, contig=%s, nooutput=%s\n",
176 (
params->no2hop ?
"YES" :
"NO"),
177 (
params->minconn ?
"YES" :
"NO"),
178 (
params->contig ?
"YES" :
"NO"),
179 (
params->nooutput ?
"YES" :
"NO")
188 printf(
"%s%.2e", (
i==0?
"":
" "), (
double)
params->ubvec[
i]);
195 printf(
"Recursive Partitioning ------------------------------------------------------\n");
198 printf(
"Direct k-way Partitioning ---------------------------------------------------\n");
214 printf(
"\nTiming Information ----------------------------------------------------------\n");
218 printf(
"\nMemory Information ----------------------------------------------------------\n");
219 printf(
" Max memory used:\t\t %7.3"PRREAL" MB\n", (
real_t)(
params->maxmemory/(1024.0*1024.0)));
220 printf(
"******************************************************************************\n");
#define I2RUBFACTOR(ufactor)
idx_t idx_t idx_t idx_t idx_t idx_t real_t idx_t idx_t * objval
static char iptypenames[][15]
void gk_free(void **ptr1,...)
int METIS_PartGraphRecursive(idx_t *nvtxs, idx_t *ncon, idx_t *xadj, idx_t *adjncy, idx_t *vwgt, idx_t *vsize, idx_t *adjwgt, idx_t *nparts, real_t *tpwgts, real_t *ubvec, idx_t *options, idx_t *objval, idx_t *part)
Recursive partitioning routine.
#define gk_getcputimer(tmr)
void errexit(char *f_str,...)
#define KMETIS_DEFAULT_UFACTOR
static const SmartProjectionParams params
graph_t * ReadGraph(params_t *params)
int METIS_PartGraphKway(idx_t *nvtxs, idx_t *ncon, idx_t *xadj, idx_t *adjncy, idx_t *vwgt, idx_t *vsize, idx_t *adjwgt, idx_t *nparts, real_t *tpwgts, real_t *ubvec, idx_t *options, idx_t *objval, idx_t *part)
#define gk_startcputimer(tmr)
static char ctypenames[][15]
void GPPrintInfo(params_t *params, graph_t *graph)
static char rtypenames[][15]
size_t gk_GetMaxMemoryUsed()
int main(int argc, char *argv[])
idx_t idx_t idx_t idx_t idx_t idx_t idx_t real_t real_t idx_t idx_t idx_t * part
params_t * parse_cmdline(int argc, char *argv[])
void ReadTPwgts(params_t *params, idx_t ncon)
void GPReportResults(params_t *params, graph_t *graph, idx_t *part, idx_t objval)
int METIS_SetDefaultOptions(idx_t *options)
static char objtypenames[][15]
#define PMETIS_DEFAULT_UFACTOR
static char ptypenames[][15]
void ComputePartitionInfo(params_t *params, graph_t *graph, idx_t *where)
NonlinearFactorGraph graph
size_t gk_GetCurMemoryUsed()
#define gk_stopcputimer(tmr)
void gk_malloc_cleanup(int showstats)
void WritePartition(char *fname, idx_t *part, idx_t n, idx_t nparts)
#define MCPMETIS_DEFAULT_UFACTOR
gtsam
Author(s):
autogenerated on Sat Nov 16 2024 04:02:23