Home
last modified time | relevance | path

Searched refs:edgelist (Results 1 – 22 of 22) sorted by relevance

/petsc/src/ksp/ksp/tutorials/network/
H A Dex4.c10 PetscInt *numEdges, **edgelist, asvtx[2], bsvtx[2]; in main() local
24 PetscCall(PetscCalloc2(Nsubnet, &numEdges, Nsubnet, &edgelist)); in main()
30 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
31 edgelist[i][0] = 0; in main()
32 edgelist[i][1] = 1; in main()
33 edgelist[i][2] = 1; in main()
34 edgelist[i][3] = 2; in main()
35 edgelist[i][4] = 2; in main()
36 edgelist[i][5] = 3; in main()
40 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
[all …]
H A Dex3.c19 PetscInt numEdges[10], *edgelist[10], asvtx, bsvtx; in main() local
54 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
55 edgelist[i][0] = 0; in main()
56 edgelist[i][1] = 2; in main()
57 edgelist[i][2] = 2; in main()
58 edgelist[i][3] = 1; in main()
59 edgelist[i][4] = 1; in main()
60 edgelist[i][5] = 3; in main()
64 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
65 edgelist[i][0] = 0; in main()
[all …]
H A Dex1_nest.c58 PetscInt *edgelist; in read_data() local
96 PetscCall(PetscCalloc1(2 * nbranch, &edgelist)); in read_data()
101 edgelist[2 * i] = 0; in read_data()
102 edgelist[2 * i + 1] = 1; in read_data()
105 edgelist[2 * i] = 0; in read_data()
106 edgelist[2 * i + 1] = 2; in read_data()
109 edgelist[2 * i] = 1; in read_data()
110 edgelist[2 * i + 1] = 2; in read_data()
113 edgelist[2 * i] = 0; in read_data()
114 edgelist[2 * i + 1] = 3; in read_data()
[all …]
H A Dex1.c59 PetscInt *edgelist; in read_data() local
95 PetscCall(PetscCalloc1(2 * nbranch, &edgelist)); in read_data()
100 edgelist[2 * i] = 0; in read_data()
101 edgelist[2 * i + 1] = 1; in read_data()
104 edgelist[2 * i] = 0; in read_data()
105 edgelist[2 * i + 1] = 2; in read_data()
108 edgelist[2 * i] = 1; in read_data()
109 edgelist[2 * i + 1] = 2; in read_data()
112 edgelist[2 * i] = 0; in read_data()
113 edgelist[2 * i + 1] = 3; in read_data()
[all …]
H A Dex2.c40 PetscInt *edgelist; in random_network() local
107 PetscCall(PetscMalloc1(2 * nedges, &edgelist)); in random_network()
110 edgelist[(aux->n) * 2] = aux->i; in random_network()
111 edgelist[(aux->n) * 2 + 1] = aux->j; in random_network()
144 fr = edgelist[(int)value * 2]; in random_network()
145 to = edgelist[(int)value * 2 + 1]; in random_network()
161 *pedgelist = edgelist; in random_network()
273 PetscInt *edgelist = NULL; in main() local
295 PetscCall(random_network(nnode, &nbranch, &node, &branch, &edgelist, seed)); in main()
306 PetscCall(DMNetworkAddSubnetwork(networkdm, "", nbranch, edgelist, NULL)); in main()
[all …]
/petsc/src/dm/tests/
H A Dex10.c15 PetscInt *edgelist = NULL; in main() local
44 PetscCall(PetscCalloc1(2 * nedge, &edgelist)); in main()
45 edgelist[0] = nodeOffset + 2; in main()
46 edgelist[1] = nodeOffset + 3; in main()
49 PetscCall(PetscCalloc1(2 * nedge, &edgelist)); in main()
50 edgelist[0] = nodeOffset + 0; in main()
51 edgelist[1] = nodeOffset + 2; in main()
52 edgelist[2] = nodeOffset + 1; in main()
53 edgelist[3] = nodeOffset + 2; in main()
57 PetscCall(DMNetworkAddSubnetwork(network, "Subnetwork 1", nedge, edgelist, NULL)); in main()
[all …]
/petsc/src/dm/impls/network/tests/
H A Dex3.c20 …rorCode StarGraphCreateEdgeList(PetscInt k, PetscBool directin, PetscInt *ne, PetscInt *edgelist[]) in StarGraphCreateEdgeList() argument
26 PetscCall(PetscCalloc1(2 * k, edgelist)); in StarGraphCreateEdgeList()
30 (*edgelist)[2 * i] = i + 1; in StarGraphCreateEdgeList()
31 (*edgelist)[2 * i + 1] = 0; in StarGraphCreateEdgeList()
35 (*edgelist)[2 * i] = 0; in StarGraphCreateEdgeList()
36 (*edgelist)[2 * i + 1] = i + 1; in StarGraphCreateEdgeList()
61 PetscInt *edgelist = NULL, *compedge, *compvert; in StarGraphCreate() local
67 if (rank == 0) PetscCall(StarGraphCreateEdgeList(k, directin, &ne, &edgelist)); in StarGraphCreate()
68 PetscCall(DMNetworkAddSubnetwork(dm, "Main", ne, edgelist, NULL)); in StarGraphCreate()
71 PetscCall(PetscFree(edgelist)); in StarGraphCreate()
H A Dex1.c20 …rorCode CreateStarGraphEdgeList(PetscInt k, PetscBool directin, PetscInt *ne, PetscInt *edgelist[]) in CreateStarGraphEdgeList() argument
26 PetscCall(PetscCalloc1(2 * k, edgelist)); in CreateStarGraphEdgeList()
30 (*edgelist)[2 * i] = i + 1; in CreateStarGraphEdgeList()
31 (*edgelist)[2 * i + 1] = 0; in CreateStarGraphEdgeList()
35 (*edgelist)[2 * i] = 0; in CreateStarGraphEdgeList()
36 (*edgelist)[2 * i + 1] = i + 1; in CreateStarGraphEdgeList()
61 PetscInt *edgelist = NULL, *compedge, *compvert; in CreateSimpleStarGraph() local
67 if (rank == 0) PetscCall(CreateStarGraphEdgeList(k, directin, &ne, &edgelist)); in CreateSimpleStarGraph()
68 PetscCall(DMNetworkAddSubnetwork(dm, "Main", ne, edgelist, NULL)); in CreateSimpleStarGraph()
71 PetscCall(PetscFree(edgelist)); in CreateSimpleStarGraph()
H A Dex2.c20 …rorCode StarGraphCreateEdgeList(PetscInt k, PetscBool directin, PetscInt *ne, PetscInt *edgelist[]) in StarGraphCreateEdgeList() argument
26 PetscCall(PetscCalloc1(2 * k, edgelist)); in StarGraphCreateEdgeList()
30 (*edgelist)[2 * i] = i + 1; in StarGraphCreateEdgeList()
31 (*edgelist)[2 * i + 1] = 0; in StarGraphCreateEdgeList()
35 (*edgelist)[2 * i] = 0; in StarGraphCreateEdgeList()
36 (*edgelist)[2 * i + 1] = i + 1; in StarGraphCreateEdgeList()
105 PetscInt *edgelist = NULL, *compedge, *compvert; in StarGraphCreate() local
112 if (rank == 0) PetscCall(StarGraphCreateEdgeList(k, directin, &ne, &edgelist)); in StarGraphCreate()
113 PetscCall(DMNetworkAddSubnetwork(dm, "Main", ne, edgelist, NULL)); in StarGraphCreate()
116 PetscCall(PetscFree(edgelist)); in StarGraphCreate()
/petsc/src/ts/tutorials/network/
H A Dpipes.c23 PetscInt *edgelist = wash->edgelist, *nvtx = NULL, *vtxDone = NULL; in WashNetworkDistribute() local
55 …PetscCallMPI(MPI_Send(edgelist + 2 * eowners[i], 2 * (eowners[i + 1] - eowners[i]), MPIU_INT, i, t… in WashNetworkDistribute()
63 PetscCall(PetscMalloc1(2 * (eend - estart), &edgelist)); in WashNetworkDistribute()
65 PetscCallMPI(MPI_Recv(edgelist, 2 * (eend - estart), MPIU_INT, 0, tag, comm, &status)); in WashNetworkDistribute()
69 wash->edgelist = edgelist; in WashNetworkDistribute()
75 v = edgelist[2 * e]; in WashNetworkDistribute()
80 v = edgelist[2 * e + 1]; in WashNetworkDistribute()
413 PetscCall(PetscFree(wash->edgelist)); in WashNetworkCleanUp()
425 PetscInt *edgelist; in WashNetworkCreate() local
444 edgelist = NULL; in WashNetworkCreate()
[all …]
H A Dwash.h55 PetscInt *edgelist; /* local edge list */ member
/petsc/src/snes/tutorials/network/water/
H A Dwater.c17 PetscInt *edgelist = NULL; in main() local
45 PetscCall(PetscCalloc1(2 * waterdata->nedge, &edgelist)); in main()
46 PetscCall(GetListofEdges_Water(waterdata, edgelist)); in main()
55 PetscCall(DMNetworkAddSubnetwork(networkdm, "", waterdata->nedge, edgelist, NULL)); in main()
61 if (!crank) PetscCall(PetscFree(edgelist)); in main()
H A Dwaterfunctions.c159 PetscErrorCode GetListofEdges_Water(WATERDATA *water, PetscInt *edgelist) in GetListofEdges_Water() argument
183 edgelist[2 * i] = j; in GetListofEdges_Water()
190 edgelist[2 * i + 1] = j; in GetListofEdges_Water()
/petsc/src/ts/tutorials/power_grid/stability_9bus/
H A Dex9busdmnetwork.c107 PetscInt *edgelist; in read_data() local
263 PetscCall(PetscCalloc1(2 * NBRANCH * nc + 2 * (nc - 1), &edgelist)); in read_data()
270 edgelist[i * 18 + 2 * j] = 0 + 9 * i; in read_data()
271 edgelist[i * 18 + 2 * j + 1] = 3 + 9 * i; in read_data()
274 edgelist[i * 18 + 2 * j] = 1 + 9 * i; in read_data()
275 edgelist[i * 18 + 2 * j + 1] = 6 + 9 * i; in read_data()
278 edgelist[i * 18 + 2 * j] = 2 + 9 * i; in read_data()
279 edgelist[i * 18 + 2 * j + 1] = 8 + 9 * i; in read_data()
282 edgelist[i * 18 + 2 * j] = 3 + 9 * i; in read_data()
283 edgelist[i * 18 + 2 * j + 1] = 4 + 9 * i; in read_data()
[all …]
/petsc/doc/manual/
H A Ddmnetwork.md50 …DMNetworkAddSubnetwork(DM dm, const char* name, PetscInt ne, PetscInt edgelist[], PetscInt *netnum…
53 …network name, `ne` is the number of local edges on the subnetwork, and `edgelist` is the connectiv…
55 Each element of `edgelist` is an integer array of size `2*ne`
70 `edgelist`
74 edgelist[0] = {0,1,1,2,2,3}
76 edgelist[1] = {1,2,2,0}
/petsc/src/dm/impls/plex/generators/ctetgen/
H A Dctetgenerate.c74 PetscCall(PetscMalloc1(in->numberofedges * 2, &in->edgelist)); in DMPlexGenerate_CTetgen()
83 in->edgelist[idx * 2] = cone[0] - vStart; in DMPlexGenerate_CTetgen()
84 in->edgelist[idx * 2 + 1] = cone[1] - vStart; in DMPlexGenerate_CTetgen()
184 …const PetscInt vertices[2] = {out->edgelist[e * 2 + 0] + numCells, out->edgelist[e * 2 + 1] + num… in DMPlexGenerate_CTetgen()
333 PetscCall(PetscMalloc1(in->numberofedges * 2, &in->edgelist)); in DMPlexRefine_CTetgen()
342 in->edgelist[idx * 2] = cone[0] - vStart; in DMPlexRefine_CTetgen()
343 in->edgelist[idx * 2 + 1] = cone[1] - vStart; in DMPlexRefine_CTetgen()
459 …const PetscInt vertices[2] = {out->edgelist[e * 2 + 0] + numCells, out->edgelist[e * 2 + 1] + num… in DMPlexRefine_CTetgen()
/petsc/src/dm/impls/plex/generators/tetgen/
H A Dtetgenerate.cxx95 in.edgelist = new int[in.numberofedges * 2]; in DMPlexGenerate_Tetgen()
104 in.edgelist[idx * 2] = cone[0] - vStart; in DMPlexGenerate_Tetgen()
105 in.edgelist[idx * 2 + 1] = cone[1] - vStart; in DMPlexGenerate_Tetgen()
197 …const PetscInt vertices[2] = {out.edgelist[e * 2 + 0] + numCells, out.edgelist[e * 2 + 1] + numCe… in DMPlexGenerate_Tetgen()
359 in.edgelist = new int[in.numberofedges * 2]; in DMPlexRefine_Tetgen()
368 in.edgelist[idx * 2] = cone[0] - vStart; in DMPlexRefine_Tetgen()
369 in.edgelist[idx * 2 + 1] = cone[1] - vStart; in DMPlexRefine_Tetgen()
478 …const PetscInt vertices[2] = {out.edgelist[e * 2 + 0] + numCells, out.edgelist[e * 2 + 1] + numCe… in DMPlexRefine_Tetgen()
/petsc/src/dm/impls/plex/generators/triangle/
H A Dtrigenerate.c42 outputCtx->edgelist = NULL; in InitOutput_Triangle()
54 free(outputCtx->edgelist); in FiniOutput_Triangle()
210 …const PetscInt vertices[2] = {out.edgelist[e * 2 + 0] + numCells, out.edgelist[e * 2 + 1] + numCe… in DMPlexGenerate_Triangle()
375 …const PetscInt vertices[2] = {out.edgelist[e * 2 + 0] + numCells, out.edgelist[e * 2 + 1] + numCe… in DMPlexRefine_Triangle()
/petsc/src/dm/impls/network/
H A Dnetwork.c212 PetscErrorCode DMNetworkAddSubnetwork(DM dm, const char *name, PetscInt ne, PetscInt edgelist[], Pe… in DMNetworkAddSubnetwork() argument
219 …edgelist[2 * i] != edgelist[2 * i + 1], PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Edge %" PetscInt_FM… in DMNetworkAddSubnetwork()
222 if (ne) nvtx_min = nvtx_max = edgelist[0]; in DMNetworkAddSubnetwork()
224 nvtx_min = PetscMin(nvtx_min, edgelist[i]); in DMNetworkAddSubnetwork()
225 nvtx_max = PetscMax(nvtx_max, edgelist[i]); in DMNetworkAddSubnetwork()
227 nvtx_min = PetscMin(nvtx_min, edgelist[i]); in DMNetworkAddSubnetwork()
228 nvtx_max = PetscMax(nvtx_max, edgelist[i]); in DMNetworkAddSubnetwork()
238 PetscCall(PetscBTSet(table, edgelist[i++] - nvtx_min)); in DMNetworkAddSubnetwork()
239 PetscCall(PetscBTSet(table, edgelist[i++] - nvtx_min)); in DMNetworkAddSubnetwork()
258 network->cloneshared->subnet[i].edgelist = edgelist; in DMNetworkAddSubnetwork()
[all …]
/petsc/include/petsc/private/
H A Ddmnetworkimpl.h87 …PetscInt *edgelist; /* User provided list of edges. Each edge has the format [from to] where f… member
/petsc/src/snes/tutorials/network/power/
H A Dpffunctions.c5 PetscErrorCode GetListofEdges_Power(PFDATA *pfdata, PetscInt *edgelist) in GetListofEdges_Power() argument
16 edgelist[2 * i] = fbus; in GetListofEdges_Power()
17 edgelist[2 * i + 1] = tbus; in GetListofEdges_Power()
/petsc/src/ksp/pc/impls/gamg/
H A Dgeo.c183 in.edgelist = NULL; in triangulateAndFormProl()
200 mid.edgelist = NULL; /* Needed only if -e switch used. */ in triangulateAndFormProl()