/dports/devel/libcutl/libcutl-1.10.0/cutl/container/ |
H A D | graph.txx | 331 delete_edge (L& l, R& r, T& edge) in delete_edge() function in cutl::container::graph
|
/dports/devel/xsd/xsd-4.1.0.a11+dep/libcutl/cutl/container/ |
H A D | graph.txx | 331 delete_edge (L& l, R& r, T& edge) in delete_edge() function in cutl::container::graph
|
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/ |
H A D | delete_edge.R | 95 delete_edge <- function(graph, function
|
/dports/databases/grass7/grass-7.8.6/vector/v.delaunay/ |
H A D | edge.c | 84 void delete_edge(struct edge *e) in delete_edge() function
|
/dports/devel/libfirm/libfirm-1.21.0/ir/kaps/ |
H A D | pbqp_edge.c | 79 void delete_edge(pbqp_edge_t *edge) in delete_edge() function
|
/dports/lang/ruby26/ruby-2.6.9/lib/rubygems/resolver/molinillo/lib/molinillo/dependency_graph/ |
H A D | log.rb | 50 def delete_edge(graph, origin_name, destination_name, requirement) method in Molinillo.DependencyGraph.Log
|
/dports/lang/ruby26/ruby-2.6.9/lib/rubygems/resolver/molinillo/lib/molinillo/ |
H A D | dependency_graph.rb | 200 def delete_edge(edge) method in Molinillo.DependencyGraph
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/ |
H A D | flow_graph.h | 126 void delete_edge(C &s) { in delete_edge() function
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/ |
H A D | flow_graph.h | 154 void delete_edge(C &s) { in delete_edge() function
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/ |
H A D | flow_graph.h | 154 void delete_edge(C &s) { in delete_edge() function
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/ |
H A D | flow_graph.h | 154 void delete_edge(C &s) { in delete_edge() function
|
/dports/misc/vxl/vxl-3.3.2/core/vgl/ |
H A D | vgl_polygon_scan_iterator.hxx | 196 void vgl_polygon_scan_iterator<T>::delete_edge( vertind v ) in delete_edge() function in vgl_polygon_scan_iterator
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Envelope_diagram_1.h | 388 void delete_edge (Edge_handle e) in delete_edge() function
|
H A D | Arr_dcel_base.h | 1201 void delete_edge(Halfedge *h) in delete_edge() function
|
/dports/math/cgal/CGAL-5.3/include/CGAL/internal/Surface_mesh_skeletonization/ |
H A D | Curve_skeleton.h | 427 void delete_edge(int p1, int p2, int eid) in delete_edge() function
|
/dports/databases/py-python-arango/python-arango-7.2.0/arango/ |
H A D | graph.py | 813 def delete_edge( member in Graph
|
/dports/math/openmesh/OpenMesh-8.1/src/OpenMesh/Core/Mesh/ |
H A D | PolyConnectivity.cc | 495 void PolyConnectivity::delete_edge(EdgeHandle _eh, bool _delete_isolated_vertices) in delete_edge() function in OpenMesh::PolyConnectivity
|
/dports/math/p5-Graph/Graph-0.9725/lib/ |
H A D | Graph.pm | 625 sub delete_edge { subroutine
|
/dports/graphics/py-pygraphviz/pygraphviz-1.6/pygraphviz/ |
H A D | agraph.py | 546 delete_edge = remove_edge variable in AGraph
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/ |
H A D | delaunay_2d.cc | 855 template<typename T> void CDTArrangement<T>::delete_edge(SymEdge<T> *se) in delete_edge() function in blender::meshintersect::CDTArrangement
|
/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/ |
H A D | flow_graph.h | 231 void delete_edge( C &s) { in delete_edge() function
|