Home
last modified time | relevance | path

Searched refs:inc_edges (Results 1 – 15 of 15) sorted by relevance

/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bmsh3d/
H A Dbmsh3d_mesh_mc.cxx188 std::vector<bmsh3d_edge*> inc_edges; in mesh_break_face() local
189 F->get_incident_Es(inc_edges); in mesh_break_face()
259 if (index == inc_edges.size()) { in mesh_break_face()
264 …std::cout << inc_edges[index]->id() << "from " << inc_edges[index]->sV()->id() << " to" << inc_edg… in mesh_break_face()
265 if (++index == inc_edges.size()) in mesh_break_face()
288 if (index == inc_edges.size()) in mesh_break_face()
292 …std::cout << inc_edges[index]->id() << "from " << inc_edges[index]->sV()->id() << " to" << inc_edg… in mesh_break_face()
293 if (++index == inc_edges.size()) in mesh_break_face()
482 std::vector<bmsh3d_edge*> inc_edges; in orient_face_normals() local
483 face->get_incident_Es(inc_edges); in orient_face_normals()
[all …]
H A Dbmsh3d_face.cxx497 std::vector<bmsh3d_edge*> inc_edges; in compute_normal() local
498 this->get_incident_Es (inc_edges); in compute_normal()
502 for (auto E : inc_edges) { in compute_normal()
/dports/math/py-altgraph/altgraph-0.15/altgraph/
H A DGraph.py327 return [self.head(n) for n in self.inc_edges(node)]
344 def inc_edges(self, node):
357 return set(self.inc_edges(node) + self.out_edges(node))
369 return len(self.inc_edges(node))
395 get_edges = self.inc_edges
497 get_edges = self.inc_edges
524 get_edges = self.inc_edges
557 get_edges = self.inc_edges
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/altgraph/
H A DGraph.py327 l = [self.head(n) for n in self.inc_edges(node)]
348 def inc_edges(self, node): member in Graph
363 return set(self.inc_edges(node) + self.out_edges(node))
375 return len(self.inc_edges(node))
401 get_edges = self.inc_edges
500 get_edges = self.inc_edges
527 get_edges = self.inc_edges
560 get_edges = self.inc_edges
/dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/altgraph/
H A DGraph.py327 l = [self.head(n) for n in self.inc_edges(node)]
348 def inc_edges(self, node): member in Graph
363 return set(self.inc_edges(node) + self.out_edges(node))
375 return len(self.inc_edges(node))
401 get_edges = self.inc_edges
500 get_edges = self.inc_edges
527 get_edges = self.inc_edges
560 get_edges = self.inc_edges
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/betr/
H A Dvsol_mesh_3d.cxx250 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
251 F->get_incident_edges (inc_edges); in extrude_face()
252 bmsh3d_edge* first_edge = inc_edges[0]; in extrude_face()
256 for (unsigned i=0; i<inc_edges.size(); i++) { in extrude_face()
257 bmsh3d_edge* edge = inc_edges[i]; in extrude_face()
286 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
288 cur_face->get_incident_edges (inc_edges); in extrude_face()
291 edge = inc_edges[j]; in extrude_face()
324 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
325 cur_face->get_incident_edges (inc_edges); in extrude_face()
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bwm/
H A Dbwm_observable_mesh.cxx991 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
992 F->get_incident_edges (inc_edges); in extrude_face()
993 bmsh3d_edge* first_edge = inc_edges[0]; in extrude_face()
997 for (unsigned i=0; i<inc_edges.size(); i++) { in extrude_face()
998 bmsh3d_edge* edge = inc_edges[i]; in extrude_face()
1027 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
1029 cur_face->get_incident_edges (inc_edges); in extrude_face()
1032 edge = inc_edges[j]; in extrude_face()
1065 std::vector<bmsh3d_edge*> inc_edges; in extrude_face()
1066 cur_face->get_incident_edges (inc_edges); in extrude_face()
[all …]
/dports/math/py-altgraph/altgraph-0.15/altgraph_tests/
H A Dtest_graph.py149 v = graph.inc_edges(1)
153 v = graph.inc_edges(5)
171 self.assertRaises(GraphError, graph.inc_edges, 'foo')
/dports/math/cgal/CGAL-5.3/include/CGAL/Tetrahedral_remeshing/internal/
H A Dcollapse_short_edges.h676 std::vector<Edge> inc_edges; variable
678 std::back_inserter(inc_edges));
680 std::back_inserter(inc_edges));
682 for (const Edge& ei : inc_edges)
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/altgraph_tests/
H A Dtest_graph.py147 v = graph.inc_edges(1)
151 v = graph.inc_edges(5)
/dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/altgraph_tests/
H A Dtest_graph.py147 v = graph.inc_edges(1)
151 v = graph.inc_edges(5)
/dports/devel/py-pyinstaller/PyInstaller-3.5/tests/unit/test_altgraph/
H A Dtest_graph.py147 v = graph.inc_edges(1)
151 v = graph.inc_edges(5)
/dports/math/py-altgraph/altgraph-0.15/doc/
H A Dgraph.rst103 .. method:: Graph.inc_edges(node)
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/doc/
H A Dgraph.rst103 .. method:: Graph.inc_edges(node)
/dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/doc/
H A Dgraph.rst103 .. method:: Graph.inc_edges(node)