/dports/math/p5-Math-Geometry-Voronoi/Math-Geometry-Voronoi-1.3/ |
H A D | voronoi_main.c | 16 AV *lines_out, *edges_out, *vertices_out; variable 36 edges_out = edges_out_in; in compute_voronoi()
|
H A D | output.c | 11 extern AV *lines_out, *edges_out, *vertices_out; 89 av_push(edges_out, newRV_noinc((SV*) av_make(3, vals))); in out_ep()
|
H A D | vdefs.h | 111 extern AV *lines_out, *edges_out, *vertices_out;
|
/dports/math/igraph/igraph-0.9.5/src/isomorphism/bliss/ |
H A D | graph.cc | 1807 iter != edges_out.end(); ) in remove_duplicate_edges() 1825 iter != edges_out.end(); in remove_duplicate_edges() 1872 std::sort(edges_out.begin(), edges_out.end()); in sort_edges() 1985 ei1 = v1.edges_out.begin(); in cmp() 1986 ei2 = v2.edges_out.begin(); in cmp() 2132 ei != v.edges_out.end(); in selfloop_invariant() 2985 ei = v.edges_out.begin(); in sh_first_max_neighbours() 3057 ei = v.edges_out.begin(); in sh_first_smallest_max_neighbours() 3131 ei = v.edges_out.begin(); in sh_first_largest_max_neighbours() 3311 ei = v.edges_out.begin(); in nucr_find_first_component() [all …]
|
H A D | graph.hh | 713 std::vector<unsigned int> edges_out; member in bliss::Digraph::Vertex 716 unsigned int nof_edges_out() const {return edges_out.size(); } in nof_edges_out()
|
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/bliss-0.73/ |
H A D | graph.cc | 1796 iter != edges_out.end(); ) in remove_duplicate_edges() 1814 iter != edges_out.end(); in remove_duplicate_edges() 1861 std::sort(edges_out.begin(), edges_out.end()); in sort_edges() 1972 ei1 = v1.edges_out.begin(); in cmp() 1973 ei2 = v2.edges_out.begin(); in cmp() 2385 ei != v.edges_out.end(); in selfloop_invariant() 3238 ei = v.edges_out.begin(); in sh_first_max_neighbours() 3310 ei = v.edges_out.begin(); in sh_first_smallest_max_neighbours() 3384 ei = v.edges_out.begin(); in sh_first_largest_max_neighbours() 3564 ei = v.edges_out.begin(); in nucr_find_first_component() [all …]
|
H A D | graph.hh | 823 std::vector<unsigned int> edges_out; member in bliss_digraphs::Digraph::Vertex 826 unsigned int nof_edges_out() const {return edges_out.size(); } in nof_edges_out() 828 edges_out.clear(); in clear()
|
/dports/math/R-cran-igraph/igraph/src/bliss/ |
H A D | graph.cc | 1896 std::sort(edges_out.begin(), edges_out.end()); in sort_edges() 2034 ei != v.edges_out.end(); in permute() 2054 ei != v.edges_out.end(); in permute() 2103 ei != v.edges_out.end(); 2162 ei != v.edges_out.end(); in get_hash() 2378 ei != v.edges_out.end(); 3031 vertex.edges_out.begin(); in is_equitable() 3508 ei != v1.edges_out.end(); in is_automorphism() 3513 ei != v2.edges_out.end(); in is_automorphism() 3553 ei != v1.edges_out.end(); in is_automorphism() [all …]
|
H A D | graph.hh | 814 std::vector<unsigned int> edges_out; member in bliss::Digraph::Vertex 817 unsigned int nof_edges_out() const {return edges_out.size(); } in nof_edges_out()
|
/dports/math/bliss/bliss-0.73/ |
H A D | graph.cc | 1904 std::sort(edges_out.begin(), edges_out.end()); in sort_edges() 2042 ei != v.edges_out.end(); in permute() 2062 ei != v.edges_out.end(); in permute() 2110 ei != v.edges_out.end(); in write_dot() 2168 ei != v.edges_out.end(); in get_hash() 2383 ei != v.edges_out.end(); in write_dimacs() 3036 vertex.edges_out.begin(); in is_equitable() 3513 ei != v1.edges_out.end(); in is_automorphism() 3518 ei != v2.edges_out.end(); in is_automorphism() 3558 ei != v1.edges_out.end(); in is_automorphism() [all …]
|
H A D | graph.hh | 806 std::vector<unsigned int> edges_out; member in bliss::Digraph::Vertex 809 unsigned int nof_edges_out() const {return edges_out.size(); } in nof_edges_out()
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/tests/ |
H A D | graphmap.rs | 81 let mut edges_out = gr.edges_directed(c, Direction::Outgoing); in edges_directed() localVariable 82 assert_eq!(edges_out.next(), Some((c, d, &2))); in edges_directed() 83 assert_eq!(edges_out.next(), Some((c, f, &11))); in edges_directed() 84 assert_eq!(edges_out.next(), None); in edges_directed()
|
/dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/tests/ |
H A D | graphmap.rs | 81 let mut edges_out = gr.edges_directed(c, Direction::Outgoing); in edges_directed() localVariable 82 assert_eq!(edges_out.next(), Some((c, d, &2))); in edges_directed() 83 assert_eq!(edges_out.next(), Some((c, f, &11))); in edges_directed() 84 assert_eq!(edges_out.next(), None); in edges_directed()
|
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/tests/ |
H A D | graphmap.rs | 81 let mut edges_out = gr.edges_directed(c, Direction::Outgoing); in edges_directed() localVariable 82 assert_eq!(edges_out.next(), Some((c, d, &2))); in edges_directed() 83 assert_eq!(edges_out.next(), Some((c, f, &11))); in edges_directed() 84 assert_eq!(edges_out.next(), None); in edges_directed()
|
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/tests/ |
H A D | graphmap.rs | 81 let mut edges_out = gr.edges_directed(c, Direction::Outgoing); in edges_directed() localVariable 82 assert_eq!(edges_out.next(), Some((c, d, &2))); in edges_directed() 83 assert_eq!(edges_out.next(), Some((c, f, &11))); in edges_directed() 84 assert_eq!(edges_out.next(), None); in edges_directed()
|
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/tests/ |
H A D | graphmap.rs | 81 let mut edges_out = gr.edges_directed(c, Direction::Outgoing); 82 assert_eq!(edges_out.next(), Some((c, d, &2))); 83 assert_eq!(edges_out.next(), Some((c, f, &11))); 84 assert_eq!(edges_out.next(), None);
|
/dports/math/igraph/igraph-0.9.5/src/layout/drl/ |
H A D | drl_parse.h | 62 int edges_out; // true if .edges file is requested variable
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | drl_parse.h | 62 int edges_out; // true if .edges file is requested variable
|
/dports/cad/horizon-eda/horizon-2.1.0/src/board/ |
H A D | airwires.cpp | 77 std::vector<Edge> edges_out; in kruskalMST() local 83 edges_out.push_back(edge); in kruskalMST() 86 return edges_out; in kruskalMST()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_2/ |
H A D | Refine_edges.h | 414 OutputItEdges edges_out(zone.boundary_edges); in conflicts_zone_impl() 443 *edges_out++ = std::make_pair(f, i); in conflicts_zone_impl() 447 *edges_out++ = std::make_pair(n, ni); in conflicts_zone_impl() 451 std::make_pair(faces_out,edges_out); in conflicts_zone_impl()
|
/dports/devel/p5-Devel-MAT/Devel-MAT-0.44/lib/Devel/MAT/ToolBase/ |
H A D | GraphWalker.pm | 79 if( $refnode->edges_out > 1 and not $refnode->roots and not $id_for{$refnode->addr} ) {
|
/dports/devel/p5-Devel-MAT/Devel-MAT-0.44/lib/Devel/MAT/ |
H A D | Graph.pm | 261 sub edges_out subroutine
|
/dports/science/ascent/ascent-0.7.1-66-gbcf2742a/src/flow/ |
H A D | flow_graph.hpp | 176 const conduit::Node &edges_out(const std::string &f_name) const;
|
H A D | flow_workspace.cpp | 108 graph.edges_out(f->name()).number_of_children() == 0) in generate() 170 int num_refs = graph.edges_out(f_name).number_of_children(); in bf_topo_sort_visit()
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
H A D | ShortestPath.cpp | 1416 …c inline void do_crossover(const std::vector<FlipEdge> &edges_in, std::vector<FlipEdge> &edges_out, in do_crossover() argument 1420 assert(edges_in.size() == edges_out.size()); in do_crossover() 1421 auto do_it = [&edges_in, &edges_out]( in do_crossover() 1425 auto it_edges_out = edges_out.begin(); in do_crossover() 1426 …auto copy_span = [&edges_in, &edges_out, &it_edges_out](std::pair<size_t, size_t> span, bool rever… in do_crossover() 1454 assert(edges_in.size() == edges_out.size()); in do_crossover() 1458 …c inline void do_crossover(const std::vector<FlipEdge> &edges_in, std::vector<FlipEdge> &edges_out, in do_crossover() argument 1462 assert(edges_in.size() == edges_out.size()); in do_crossover() 1463 auto do_it = [&edges_in, &edges_out]( in do_crossover() 1468 auto it_edges_out = edges_out.begin(); in do_crossover() [all …]
|