Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 153) sorted by relevance

1234567

/petsc/src/ksp/pc/impls/bddc/
H A Dbddcgraph.c22 PetscErrorCode PCBDDCGraphGetDirichletDofsB(PCBDDCGraph graph, IS *dirdofs) in PCBDDCGraphGetDirichletDofsB() argument
25 if (graph->dirdofsB) { in PCBDDCGraphGetDirichletDofsB()
26 PetscCall(PetscObjectReference((PetscObject)graph->dirdofsB)); in PCBDDCGraphGetDirichletDofsB()
27 } else if (graph->has_dirichlet) { in PCBDDCGraphGetDirichletDofsB()
32 for (i = 0; i < graph->nvtxs; i++) { in PCBDDCGraphGetDirichletDofsB()
33 …if (graph->nodes[i].count > 1 && graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) size++; in PCBDDCGraphGetDirichletDofsB()
38 for (i = 0; i < graph->nvtxs; i++) { in PCBDDCGraphGetDirichletDofsB()
39 …if (graph->nodes[i].count > 1 && graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) dirdof… in PCBDDCGraphGetDirichletDofsB()
41 …PetscCall(ISCreateGeneral(PETSC_COMM_SELF, size, dirdofs_idxs, PETSC_OWN_POINTER, &graph->dirdofsB… in PCBDDCGraphGetDirichletDofsB()
42 PetscCall(PetscObjectReference((PetscObject)graph->dirdofsB)); in PCBDDCGraphGetDirichletDofsB()
[all …]
/petsc/config/BuildSystem/
H A Dgraph.py79 def addSubgraph(self, graph): argument
81 map(self.addVertex, graph.vertices)
82 map(lambda v: self.addEdges(v, *graph.getEdges(v)), graph.vertices)
85 def removeSubgraph(self, graph): argument
87 map(self.removeVertex, graph.vertices)
101 def appendGraph(self, graph): argument
104 self.addSubgraph(graph)
105 map(lambda v: self.addEdges(v, outputs = DirectedGraph.getRoots(graph)), leaves)
108 def prependGraph(self, graph): argument
111 self.addSubgraph(graph)
[all …]
/petsc/src/vec/is/sf/tests/output/
H A Dex3_2.out2 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_GATHER graph with op = MPI_SUM
32 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLGATHER graph with op = MPI_SUM
72 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLTOALL graph with op = MPI_SUM
H A Dex3_1.out2 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_GATHER graph with op = MPI_REPLACE
32 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLGATHER graph with op = MPI_REPLACE
72 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLTOALL graph with op = MPI_REPLACE
H A Dex3_4.out2 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_GATHER graph with op = MPI_SUM
34 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLGATHER graph with op = MPI_SUM
86 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLTOALL graph with op = MPI_SUM
H A Dex3_3.out2 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_GATHER graph with op = MPI_REPLACE
34 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLGATHER graph with op = MPI_REPLACE
86 Testing PetscSFFetchAndOp on a PETSCSF_PATTERN_ALLTOALL graph with op = MPI_REPLACE
/petsc/src/ksp/pc/impls/mg/
H A Dgdsw.c15 PCBDDCGraph graph; in PCMGGDSWSetUp() local
99 graph = ipcbddc->mat_graph; in PCMGGDSWSetUp()
105 PetscCall(PCBDDCGraphInit(graph, l2g, N, PETSC_INT_MAX)); in PCMGGDSWSetUp()
106 …owIJ(lA, 0, PETSC_TRUE, PETSC_FALSE, &graph->nvtxs_csr, (const PetscInt **)&graph->xadj, (const Pe… in PCMGGDSWSetUp()
107 PetscCall(PCBDDCGraphSetUp(graph, vsize, NULL, NULL, 0, NULL, NULL)); in PCMGGDSWSetUp()
108 …owIJ(lA, 0, PETSC_TRUE, PETSC_FALSE, &graph->nvtxs_csr, (const PetscInt **)&graph->xadj, (const Pe… in PCMGGDSWSetUp()
109 PetscCall(PCBDDCGraphComputeConnectedComponents(graph)); in PCMGGDSWSetUp()
111 l2g = graph->l2gmap; in PCMGGDSWSetUp()
157 …PetscCall(PCBDDCSubSchursInit(sub_schurs, prefix, ipcis->is_I_local, ipcis->is_B_local, graph, ipc… in PCMGGDSWSetUp()
158 …if (userdefined) PetscCall(PCBDDCComputeFakeChange(pcbddc, PETSC_FALSE, graph, NULL, &cmat, &cref,… in PCMGGDSWSetUp()
[all …]
/petsc/src/dm/impls/plex/tests/output/
H A Dex31_0_nsize-3_faces-5__4__3_entity_depth-1_parallel-FALSE.out2 Size of generated auxiliary graph: 67
3 Using METIS to partition graph.
H A Dex31_0_nsize-4_faces-5__4__3_entity_depth-1_parallel-FALSE.out2 Size of generated auxiliary graph: 87
3 Using METIS to partition graph.
H A Dex31_0_nsize-2_faces-7__11__5_entity_depth-1_parallel-TRUE.out2 Size of generated auxiliary graph: 95
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-3_faces-5__4__3_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 42
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-4_faces-2__3__4_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 32
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-3_faces-5__4__3_entity_depth-1_parallel-TRUE.out2 Size of generated auxiliary graph: 67
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-3_faces-2__3__4_entity_depth-0_parallel-FALSE.out2 Size of generated auxiliary graph: 24
3 Using METIS to partition graph.
H A Dex31_0_nsize-2_faces-5__4__3_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 26
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-4_faces-5__4__3_entity_depth-1_parallel-TRUE.out2 Size of generated auxiliary graph: 87
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-3_faces-7__11__5_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 105
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-2_faces-2__3__4_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 14
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-2_faces-7__11__5_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 56
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-3_faces-7__11__5_entity_depth-1_parallel-FALSE.out2 Size of generated auxiliary graph: 184
3 Using METIS to partition graph.
H A Dex31_0_nsize-2_faces-7__11__5_entity_depth-1_parallel-FALSE.out2 Size of generated auxiliary graph: 95
3 Using METIS to partition graph.
H A Dex31_0_nsize-2_faces-7__11__5_entity_depth-0_parallel-FALSE.out2 Size of generated auxiliary graph: 56
3 Using METIS to partition graph.
H A Dex31_0_nsize-4_faces-2__3__4_entity_depth-0_parallel-FALSE.out2 Size of generated auxiliary graph: 32
3 Using METIS to partition graph.
H A Dex31_0_nsize-4_faces-7__11__5_entity_depth-0_parallel-TRUE.out2 Size of generated auxiliary graph: 125
3 Using ParMETIS to partition graph.
H A Dex31_0_nsize-2_faces-5__4__3_entity_depth-1_parallel-TRUE.out2 Size of generated auxiliary graph: 40
3 Using ParMETIS to partition graph.

1234567