Go to the documentation of this file.
36 if (
graph == orggraph)
60 graph->where =
imalloc(nvtxs,
"Allocate2WayPartitionMemory: where");
61 graph->bndptr =
imalloc(nvtxs,
"Allocate2WayPartitionMemory: bndptr");
62 graph->bndind =
imalloc(nvtxs,
"Allocate2WayPartitionMemory: bndind");
63 graph->id =
imalloc(nvtxs,
"Allocate2WayPartitionMemory: id");
64 graph->ed =
imalloc(nvtxs,
"Allocate2WayPartitionMemory: ed");
73 idx_t i,
j, nvtxs,
ncon, nbnd, mincut, istart, iend, tid, ted, me;
90 bndind =
graph->bndind;
94 for (
i=0;
i<nvtxs;
i++) {
101 for (
i=0;
i<nvtxs;
i++) {
110 for (nbnd=0, mincut=0,
i=0;
i<nvtxs;
i++) {
117 for (
j=istart;
j<iend;
j++) {
126 if (ted > 0 || istart == iend) {
132 graph->mincut = mincut/2;
143 idx_t i,
j, istart, iend, nvtxs, nbnd, me, tid, ted;
146 idx_t *cwhere, *cbndptr;
152 cgraph =
graph->coarser;
153 cwhere = cgraph->
where;
156 nvtxs =
graph->nvtxs;
167 bndind =
graph->bndind;
171 for (
i=0;
i<nvtxs;
i++) {
174 cmap[
i] = cbndptr[
j];
178 for (nbnd=0,
i=0;
i<nvtxs;
i++) {
184 for (
j=istart;
j<iend;
j++)
189 for (
j=istart;
j<iend;
j++) {
199 if (ted > 0 || istart == iend)
void Compute2WayPartitionParams(ctrl_t *ctrl, graph_t *graph)
void Project2WayPartition(ctrl_t *ctrl, graph_t *graph)
idx_t idx_t idx_t idx_t idx_t idx_t * adjwgt
idx_t idx_t idx_t idx_t idx_t idx_t idx_t real_t * tpwgts
idx_t idx_t idx_t * adjncy
#define IFSET(a, flag, cmd)
#define BNDInsert(nbnd, bndind, bndptr, vtx)
static const Similarity3 id
#define gk_startcputimer(tmr)
idx_t idx_t idx_t idx_t * vwgt
#define ASSERT(expression)
void Refine2Way(ctrl_t *ctrl, graph_t *orggraph, graph_t *graph, real_t *tpwgts)
idx_t idx_t idx_t idx_t * where
NonlinearFactorGraph graph
#define gk_stopcputimer(tmr)
void Allocate2WayPartitionMemory(ctrl_t *ctrl, graph_t *graph)
gtsam
Author(s):
autogenerated on Sat Nov 16 2024 04:03:58