Home
last modified time | relevance | path

Searched refs:outer_vertices (Results 1 – 5 of 5) sorted by relevance

/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dregular.py98 self.outer_vertices = [(node, x) for x in range(degree)]
106 self.outer_vertices, neighbors, edge_attrs
110 for outer in self.outer_vertices:
116 for outer in self.outer_vertices:
122 g.remove_nodes_from(self.outer_vertices)
132 self.outer_vertices = [(node, x) for x in range(degree)]
139 self.outer_vertices, self.inner_vertices, list(adj_view.items())
150 for outer in self.outer_vertices:
156 self.g.remove_nodes_from(self.outer_vertices)
/dports/science/py-nilearn/nilearn-0.8.1/nilearn/surface/
H A Dsurface.py111 outer_vertices, _ = mesh
119 sample_locations = outer_vertices + steps * (
120 inner_vertices - outer_vertices)
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/external/openglcts/modules/glesext/tessellation_shader/
H A DesextcTessellationShaderInvariance.cpp1155 std::vector<_vertex> outer_vertices; in verifyResultData() local
1170 for (std::vector<_vertex>::const_iterator vertex_iterator = outer_vertices.begin(); in verifyResultData()
1171 vertex_iterator != outer_vertices.end(); vertex_iterator++) in verifyResultData()
1190 outer_vertices.push_back(vertex); in verifyResultData()
1195 DE_ASSERT(outer_vertices.size() != 0); in verifyResultData()
1198 for (std::vector<_vertex>::const_iterator ref_vertex_iterator = outer_vertices.begin(); in verifyResultData()
1199 ref_vertex_iterator != outer_vertices.end(); ref_vertex_iterator++) in verifyResultData()
/dports/games/freeorion/freeorion-0.4.10.2/GG/src/
H A DDrawUtil.cpp636 GLint outer_vertices[] = { in BeginStencilClipping() local
642 glVertexPointer(2, GL_INT, 0, outer_vertices); in BeginStencilClipping()
/dports/math/giacxcas/giac-1.6.0/src/
H A Dgraphtheory.cc1664 vecteur root_nodes,outer_vertices; in _draw_graph() local
1697 outer_vertices=*rh._VECTptr; in _draw_graph()
1775 if (!outer_vertices.empty()) { in _draw_graph()
1779 int m=outer_vertices.size(),index; in _draw_graph()
1781 for (const_iterateur jt=outer_vertices.begin();jt!=outer_vertices.end();++jt) { in _draw_graph()
1785 hull[jt-outer_vertices.begin()]=index; in _draw_graph()