Home
last modified time | relevance | path

Searched refs:numEdges (Results 1 – 16 of 16) 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()
29 numEdges[i] = 3; in main()
30 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
39 numEdges[i] = 3; in main()
40 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
49 numEdges[i] = 3; in main()
50 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
51 for (j = 0; j < numEdges[i]; j++) { in main()
70 PetscCall(DMNetworkAddSubnetwork(dmnetwork, NULL, numEdges[i], edgelist[i], &netNum)); in main()
[all …]
H A Dex3.c19 PetscInt numEdges[10], *edgelist[10], asvtx, bsvtx; in main() local
50 for (i = 0; i < Nsubnet; i++) numEdges[i] = 0; in main()
53 numEdges[i] = 3; in main()
54 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
63 numEdges[i] = 3; in main()
64 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
73 numEdges[i] = 3; in main()
74 PetscCall(PetscMalloc1(2 * numEdges[i], &edgelist[i])); in main()
75 for (j = 0; j < numEdges[i]; j++) { in main()
85 PetscCall(DMNetworkAddSubnetwork(dmnetwork, NULL, numEdges[i], edgelist[i], &netNum)); in main()
/petsc/src/ts/tutorials/network/
H A Dpipes.c22 …PetscInt i, e, v, numEdges, numVertices, nedges, *eowners = NULL, estart, eend, *vtype = NULL, … in WashNetworkDistribute() local
30 numEdges = wash->nedge; in WashNetworkDistribute()
34 PetscCallMPI(MPI_Bcast(&numEdges, 1, MPIU_INT, 0, comm)); in WashNetworkDistribute()
35 nedges = numEdges / size; /* local nedges */ in WashNetworkDistribute()
36 if (rank == 0) nedges += numEdges - size * (numEdges / size); in WashNetworkDistribute()
37 wash->Nedge = numEdges; in WashNetworkDistribute()
424 PetscInt i, numVertices, numEdges, *vtype; in WashNetworkCreate() local
443 numEdges = 0; in WashNetworkCreate()
464 numEdges = 0; in WashNetworkCreate()
468 numEdges = wash->nedge; in WashNetworkCreate()
[all …]
/petsc/src/dm/impls/plex/generators/triangle/
H A Dtrigenerate.c212 PetscInt numEdges; in DMPlexGenerate_Triangle() local
214 PetscCall(DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_Triangle()
215 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexGenerate_Triangle()
218 PetscCall(DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_Triangle()
377 PetscInt numEdges; in DMPlexRefine_Triangle() local
379 PetscCall(DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_Triangle()
380 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexRefine_Triangle()
382 PetscCall(DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_Triangle()
/petsc/src/dm/partitioner/impls/matpart/
H A Dpartmatpart.c94 PetscInt numVerticesGlobal, numEdges; in PetscPartitionerPartition_MatPartitioning() local
107 numEdges = start[numVertices]; in PetscPartitionerPartition_MatPartitioning()
109 PetscCall(PetscMalloc1(numEdges, &j)); in PetscPartitionerPartition_MatPartitioning()
111 PetscCall(PetscArraycpy(j, adjacency, numEdges)); in PetscPartitionerPartition_MatPartitioning()
/petsc/src/dm/impls/plex/generators/ctetgen/
H A Dctetgenerate.c186 PetscInt numEdges; in DMPlexGenerate_CTetgen() local
188 PetscCall(DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_CTetgen()
189 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexGenerate_CTetgen()
191 PetscCall(DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_CTetgen()
461 PetscInt numEdges; in DMPlexRefine_CTetgen() local
463 PetscCall(DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_CTetgen()
464 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexRefine_CTetgen()
466 PetscCall(DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_CTetgen()
/petsc/src/snes/tutorials/network/power/
H A Dpower.c70 PetscInt numEdges = 0; in main() local
110 numEdges = pfdata->nbranch; in main()
111 PetscCall(PetscMalloc1(2 * numEdges, &edges)); in main()
124 PetscCall(DMNetworkAddSubnetwork(networkdm, "", numEdges, edges, NULL)); in main()
/petsc/src/binding/petsc4py/demo/legacy/dmplex/
H A Danisotropic_adaptation.py34 numEdges = 10 variable
36 plex = PETSc.DMPlex().createBoxMesh([numEdges]*dim, simplex=simplex)
/petsc/src/dm/impls/plex/generators/tetgen/
H A Dtetgenerate.cxx199 PetscInt numEdges; in DMPlexGenerate_Tetgen() local
201 PetscCall(DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_Tetgen()
202 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexGenerate_Tetgen()
204 PetscCall(DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges)); in DMPlexGenerate_Tetgen()
480 PetscInt numEdges; in DMPlexRefine_Tetgen() local
482 PetscCall(DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_Tetgen()
483 …PetscCheck(numEdges == 1, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge,… in DMPlexRefine_Tetgen()
485 PetscCall(DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges)); in DMPlexRefine_Tetgen()
/petsc/src/snes/tutorials/network/
H A Dex1.c459 PetscInt Nsubnet = 2, numVertices[2], numEdges[2], i, j, nv, ne, it_max = 10; in main() local
498 numEdges[i] = 0; in main()
509 numEdges[0] = pfdata->nbranch; in main()
512 PetscCall(PetscMalloc1(2 * numEdges[0], &edgelist_power)); in main()
530 numEdges[1] = waterdata->nedge; in main()
556 …], numVertices[1], numVertices[0] + numVertices[1], numEdges[0], numEdges[1], numEdges[0] + numEdg… in main()
560 PetscCall(DMNetworkAddSubnetwork(networkdm, "power", numEdges[0], edgelist_power, &power_netnum)); in main()
561 PetscCall(DMNetworkAddSubnetwork(networkdm, "water", numEdges[1], edgelist_water, &water_netnum)); in main()
/petsc/src/dm/impls/plex/
H A Dplexegads.c882 …= -1, numCorners = 0, maxCorners = 0, numVertices = 0, newVertices = 0, numEdges = 0, numCells = 0… in DMPlexCreateGeom_Internal() local
907 numEdges = 0; in DMPlexCreateGeom_Internal()
949 if (!found) PetscCall(PetscHMapISet(edgeMap, id - 1, numEdges++)); in DMPlexCreateGeom_Internal()
989 PetscCall(PetscHMapIGetSize(edgeMap, &numEdges)); in DMPlexCreateGeom_Internal()
990 newVertices = numEdges + numQuads; in DMPlexCreateGeom_Internal()
1033 fOff = numVertices - newVertices + numEdges; in DMPlexCreateGeom_Internal()
1034 numEdges = 0; in DMPlexCreateGeom_Internal()
1081 PetscInt v = numVertices - newVertices + numEdges; in DMPlexCreateGeom_Internal()
1085 PetscCall(PetscHMapISet(edgeMap, eid - 1, numEdges++)); in DMPlexCreateGeom_Internal()
1142 …PetscCheck(numEdges + numQuads == newVertices, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Number of new ver… in DMPlexCreateGeom_Internal()
[all …]
H A Dplexcreate.c589 const PetscInt numEdges = edges[0] * (edges[1] + 1) + (edges[0] + 1) * edges[1]; in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal() local
614 PetscCall(DMPlexSetChart(dm, 0, numEdges + numVertices)); in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
615 for (e = 0; e < numEdges; ++e) PetscCall(DMPlexSetConeSize(dm, e, 2)); in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
620 PetscInt vertex = ey * (edges[0] + 1) + vx + numEdges; in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
646 PetscInt vertex = vy * (edges[0] + 1) + ex + numEdges; in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
676 PetscCall(PetscSectionSetChart(coordSection, numEdges, numEdges + numVertices)); in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
678 for (v = numEdges; v < numEdges + numVertices; ++v) { in DMPlexCreateBoxSurfaceMesh_Tensor_2D_Internal()
1299 const PetscInt numEdges = numTotXEdges + numTotYEdges + numZEdges; in DMPlexCreateSquareMesh_Simplex_CrissCross() local
1311 PetscCall(DMPlexSetChart(dm, 0, numCells + numEdges + numVertices)); in DMPlexCreateSquareMesh_Simplex_CrissCross()
1313 for (e = firstXEdge; e < firstXEdge + numEdges; ++e) PetscCall(DMPlexSetConeSize(dm, e, 2)); in DMPlexCreateSquareMesh_Simplex_CrissCross()
[all …]
H A Dplexpartition.c282 PetscInt numEdges = end - start, *PETSC_RESTRICT edges; in DMPlexCreatePartitionerGraph_Native() local
283 PetscCall(PetscSortRemoveDupsInt(&numEdges, &graph[start])); in DMPlexCreatePartitionerGraph_Native()
284 PetscCall(PetscSectionSetDof(section, p, numEdges)); in DMPlexCreatePartitionerGraph_Native()
285 PetscCall(PetscSegBufferGetInts(adjBuffer, numEdges, &edges)); in DMPlexCreatePartitionerGraph_Native()
286 PetscCall(PetscArraycpy(edges, &graph[start], numEdges)); in DMPlexCreatePartitionerGraph_Native()
839 const PetscInt numEdges = start[numVertices]; in PetscPartitionerDMPlexPartition() local
842 PetscCall(PetscSectionSetChart(edgeSection, 0, numEdges)); in PetscPartitionerDMPlexPartition()
/petsc/src/ts/tutorials/power_grid/stability_9bus/
H A Dex9busdmnetwork.c968 PetscInt numEdges = 0; in main() local
990 if (rank == 0) numEdges = NBRANCH * nc + (nc - 1); in main()
992 PetscCall(DMNetworkAddSubnetwork(networkdm, NULL, numEdges, edgelist, NULL)); in main()
/petsc/src/dm/impls/plex/exodusii/
H A Dplexexodusii2.c778 …nd, p, cStart, cEnd, numCells, vStart, vEnd, numVertices, eStart, eEnd, numEdges, fStart, fEnd, nu… in DMView_PlexExodusII() local
815 numEdges = eEnd - eStart; in DMView_PlexExodusII()
817 …PetscCheck(!(rank && (numCells || numEdges || numVertices)), PETSC_COMM_SELF, PETSC_ERR_SUP, "Writ… in DMView_PlexExodusII()
868 if (degree == 2) numNodes += numEdges; in DMView_PlexExodusII()
/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h1506 p4est_topidx_t numEdges, numEtt; in DMPlexCreateConnectivity_pforest() local
1556 PetscCall(P4estTopidxCast(eEnd - eStart, &numEdges)); in DMPlexCreateConnectivity_pforest()
1587 …PetscCallP4estReturn(conn, p8est_connectivity_new, (numVerts, numTrees, numEdges, numEtt, numCorns… in DMPlexCreateConnectivity_pforest()