/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/classes/ |
H A D | directed_graph.py | 98 return [self.get_edge(edge_id)['vertices'][1] for edge_id in node['edges']] 112 edge = self.get_edge(edge_id) 135 def get_edge(self, edge_id): member in DirectedGraph 153 edge = self.get_edge(edge_id) 175 edge = self.get_edge(e_id) 204 edge = self.get_edge(edge_id) 220 edge = self.get_edge(edge_id) 233 … return [edge_id for edge_id in node['edges'] if self.get_edge(edge_id)['vertices'][1] == node_b]
|
H A D | undirected_graph.py | 32 for a, b in [self.get_edge(edge_id)['vertices'] for edge_id in node['edges']]: 42 edge = self.get_edge(edge_id) 67 edge = self.get_edge(edge_id) 91 …if (self.get_edge(edge_id)['vertices'][1] == node_b or self.get_edge(edge_id)['vertices'][0] == no…
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/ |
H A D | test_merge_graphs.py | 58 original_edge = original_graph.get_edge(edge_id) 59 new_edge = main_graph.get_edge(edge_id) 98 original_edge = original_graph.get_edge(edge_id) 99 new_edge = main_graph.get_edge(edge_id) 145 original_edge = original_graph.get_edge(edge_id) 146 new_edge = main_graph.get_edge(edge_id) 164 original_edge = addition_graph.get_edge(edge_id) 165 new_edge = main_graph.get_edge(edge_map[edge_id])
|
H A D | test_make_subgraph.py | 44 original_edge = graph.get_edge(edge_id) 45 new_edge = subgraph.get_edge(edge_id) 90 edge = subgraph.get_edge(edge_id)
|
/dports/math/ogdf/OGDF/include/ogdf/energybased/fmmm/multilevel/ |
H A D | Edge.h | 83 edge get_edge() const { return e; } in get_edge() function 105 int source_index = E.get_edge()->source()->index(); in get_max_index() 106 int target_index = E.get_edge()->target()->index(); in get_max_index() 129 int source_index = E.get_edge()->source()->index(); in get_min_index() 130 int target_index = E.get_edge()->target()->index(); in get_min_index()
|
/dports/devel/py-transitions/transitions-0.8.8/tests/ |
H A D | test_pygraphviz.py | 67 e = m.get_graph().get_edge('B', 'A') 69 e = m.get_graph().get_edge('A', 'C') 72 m.get_graph().get_edge('A', 'B') 74 self.assertEqual(len(m2.get_graph().get_edge('B', 'A')), 2) 75 self.assertEqual(m2.get_graph().get_edge('A', 'B').attr['label'], 'to_B')
|
/dports/graphics/autotrace/autotrace-0.31.1/ |
H A D | image-proc.c | 22 static at_bool get_edge(bitmap_type, int y, int x, struct etyp *t); 369 k = (!get_edge(b, y, x, &t) 370 || (get_edge(b, y, x+1, &t) && *BITMAP_PIXEL(b, y-1, x) 372 || (get_edge(b, y+1, x, &t) && *BITMAP_PIXEL(b, y, x-1) 374 || (get_edge(b, y, x+1, &t) && get_edge(b, y+1, x+1, &t) 375 && get_edge(b, y+1, x, &t))); 378 get_edge(b, y, x, &t); 395 k = (!get_edge(b, y, x, &t) 401 || (get_edge(b, y+1, x, &t) && get_edge(b, y, x+1, &t) 402 && get_edge(b, y+1, x+1, &t))); [all …]
|
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/autotrace/ |
H A D | image-proc.c | 30 static gboolean get_edge(bitmap_type, int y, int x, struct etyp *t); 355 k = (!get_edge(b, y, x, &t) 356 || (get_edge(b, y, x + 1, &t) && *AT_BITMAP_PIXEL(b, y - 1, x) 358 || (get_edge(b, y + 1, x, &t) && *AT_BITMAP_PIXEL(b, y, x - 1) 360 || (get_edge(b, y, x + 1, &t) && get_edge(b, y + 1, x + 1, &t) 361 && get_edge(b, y + 1, x, &t))); 365 get_edge(b, y, x, &t); 383 k = (!get_edge(b, y, x, &t) 389 || (get_edge(b, y + 1, x, &t) && get_edge(b, y, x + 1, &t) 390 && get_edge(b, y + 1, x + 1, &t))); [all …]
|
/dports/graphics/netpbm/netpbm-10.91.01/converter/other/pamtosvg/ |
H A D | image-proc.c | 23 static bool get_edge(bitmap_type, int y, int x, struct etyp *t); 382 k = (!get_edge(b, y, x, &t) 383 || (get_edge(b, y, x+1, &t) && *BITMAP_PIXEL(b, y-1, x) 385 || (get_edge(b, y+1, x, &t) && *BITMAP_PIXEL(b, y, x-1) 387 || (get_edge(b, y, x+1, &t) && get_edge(b, y+1, x+1, &t) 388 && get_edge(b, y+1, x, &t))); 391 get_edge(b, y, x, &t); 408 k = (!get_edge(b, y, x, &t) 414 || (get_edge(b, y+1, x, &t) && get_edge(b, y, x+1, &t) 415 && get_edge(b, y+1, x+1, &t))); [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Triangular_expansion_visibility_2.h | 224 if(!p_cdt->is_constrained(get_edge(fh,0))){ in compute_visibility() 234 if(!p_cdt->is_constrained(get_edge(fh,1))){ in compute_visibility() 244 if(!p_cdt->is_constrained(get_edge(fh,2))){ in compute_visibility() 312 if(!p_cdt->is_constrained(get_edge(fh,p_cdt->cw(index)))){ in compute_visibility() 360 if(!p_cdt->is_constrained(get_edge(fh,index))){ in compute_visibility() 412 CGAL_assertion(!p_cdt->is_constrained(get_edge(fh,index))); in collect_needle() 432 typename CDT::Edge re = get_edge(nfh,p_cdt->ccw(nindex)); in collect_needle() 433 typename CDT::Edge le = get_edge(nfh,p_cdt-> cw(nindex)); in collect_needle() 506 CGAL_assertion(!p_cdt->is_constrained(get_edge(fh,index))); in expand_edge() 527 typename CDT::Edge re = get_edge(nfh,p_cdt->ccw(nindex)); in expand_edge() [all …]
|
/dports/devel/py-transitions/transitions-0.8.8/transitions/extensions/ |
H A D | diagrams_pygraphviz.py | 49 edge = container.get_edge(src, dst) 113 edge = self.fsm_graph.get_edge(src, dst) 116 edge = self.fsm_graph.get_edge(src, dst) 195 edge = container.get_edge(src_name, dst_name) 215 edge = self.fsm_graph.get_edge(src, dst) 226 edge = self.fsm_graph.get_edge(_src, _dst) 229 edge = self.fsm_graph.get_edge(_src, _dst)
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/helpers/ |
H A D | functions.py | 44 edge = udg.get_edge(edge_id) 61 e = dg.get_edge(edge_id) 76 e = udg.get_edge(edge_id) 92 edge = graph.get_edge(edge_id)
|
/dports/misc/vxl/vxl-3.3.2/contrib/gel/gevd/ |
H A D | gevd_region_edge.cxx | 39 vtol_edge_2d_sptr source = re->get_edge(); in Prop() 40 vtol_edge_2d_sptr target = this->get_edge(); in Prop()
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/sdet/ |
H A D | sdet_region_edge.cxx | 60 vtol_edge_2d_sptr source = re->get_edge(); in Prop() 61 vtol_edge_2d_sptr target = this->get_edge(); in Prop()
|
/dports/lang/sdcc/sdcc-4.0.0/support/regression/tests/ |
H A D | bug3565757.c | 32 void get_edge(struct edge_t *const e, const edge_index_t e_i) in get_edge() function 52 get_edge(&edge_cache, i); in init_geometry()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/animation/ |
H A D | length_list_property_functions.cc | 50 get_edge = &FillLayer::BackgroundXOrigin; in FillLayerMethods() 58 get_edge = &FillLayer::BackgroundYOrigin; in FillLayerMethods() 70 BackgroundEdgeOrigin (FillLayer::*get_edge)() const = nullptr; 169 switch ((fill_layer->*fill_layer_methods.get_edge)()) { in GetLengthList()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/animation/ |
H A D | length_list_property_functions.cc | 50 get_edge = &FillLayer::BackgroundXOrigin; in FillLayerMethods() 58 get_edge = &FillLayer::BackgroundYOrigin; in FillLayerMethods() 70 BackgroundEdgeOrigin (FillLayer::*get_edge)() const = nullptr; 172 switch ((fill_layer->*fill_layer_methods.get_edge)()) { in GetLengthList()
|
/dports/math/py-networkx/networkx-2.6.3/networkx/drawing/ |
H A D | nx_agraph.py | 161 a = A.get_edge(u, v) 169 a = A.get_edge(u, v) 413 edge = A.get_edge(u, v, str(key)) 417 edge = A.get_edge(u, v)
|
/dports/cad/pcb/pcb-4.2.0/gts/ |
H A D | isotetra.c | 265 e1 = get_edge (v1, v2, surface->edge_class); in add_face() 266 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 267 e3 = get_edge (v1, v3, surface->edge_class); in add_face() 269 e1 = get_edge (v1, v3, surface->edge_class); in add_face() 270 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 271 e3 = get_edge (v1, v2, surface->edge_class); in add_face() 298 e1 = get_edge (v1, v2, surface->edge_class); in add_face_bcl() 299 e2 = get_edge (v2, v3, surface->edge_class); in add_face_bcl() 300 e3 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() 302 e1 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() [all …]
|
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/gts/src/ |
H A D | isotetra.c | 265 e1 = get_edge (v1, v2, surface->edge_class); in add_face() 266 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 267 e3 = get_edge (v1, v3, surface->edge_class); in add_face() 269 e1 = get_edge (v1, v3, surface->edge_class); in add_face() 270 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 271 e3 = get_edge (v1, v2, surface->edge_class); in add_face() 298 e1 = get_edge (v1, v2, surface->edge_class); in add_face_bcl() 299 e2 = get_edge (v2, v3, surface->edge_class); in add_face_bcl() 300 e3 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() 302 e1 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() [all …]
|
/dports/graphics/gts/gts-0.7.6/src/ |
H A D | isotetra.c | 265 e1 = get_edge (v1, v2, surface->edge_class); in add_face() 266 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 267 e3 = get_edge (v1, v3, surface->edge_class); in add_face() 269 e1 = get_edge (v1, v3, surface->edge_class); in add_face() 270 e2 = get_edge (v2, v3, surface->edge_class); in add_face() 271 e3 = get_edge (v1, v2, surface->edge_class); in add_face() 298 e1 = get_edge (v1, v2, surface->edge_class); in add_face_bcl() 299 e2 = get_edge (v2, v3, surface->edge_class); in add_face_bcl() 300 e3 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() 302 e1 = get_edge (v1, v3, surface->edge_class); in add_face_bcl() [all …]
|
/dports/devel/libfirm/libfirm-1.21.0/ir/kaps/ |
H A D | kaps.c | 44 pbqp_edge_t *get_edge(pbqp_t *pbqp, unsigned src_index, unsigned tgt_index) in get_edge() function 119 pbqp_edge_t *edge = get_edge(pbqp, src_index, tgt_index); in add_edge_costs()
|
/dports/security/nmap/nmap-7.91/zenmap/radialnet/core/ |
H A D | Graph.py | 82 def get_edge(self, dest): member in Node 197 edge = a.get_edge(b)
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/functions/ |
H A D | biconnected_components.py | 127 edge = graph.get_edge(edge_id) 162 edge = graph.get_edge(edge_id) 186 edge = graph.get_edge(edge_id)
|
/dports/games/openjk/OpenJK-07675e2/code/game/ |
H A D | g_navigator.cpp | 808 return mGraph.get_edge(Handle); in GetEdge() 1014 …targetNode = (Q_irand(0,1)==0)?(mGraph.get_edge(abs(targetNode)).mNodeA):(mGraph.get_edge(abs(targ… in GoTo() 1090 …targetNode = (Q_irand(0,1)==0)?(mGraph.get_edge(abs(targetNode)).mNodeA):(mGraph.get_edge(abs(targ… in GoTo() 1214 CWayEdge& at = mGraph.get_edge(atHandle); in TestEdge() 2225 CWayEdge& edge = mGraph.get_edge(edgeHandle); in RegisterDangerSense() 2285 CWayEdge& edge = mGraph.get_edge(EdgeHandle); in WayEdgesNowClear() 2753 CWayEdge& edge = mGraph.get_edge(abs(cur)); in ChooseFarthestNeighbor() 2822 …start = (Q_irand(0,1)==0)?(mGraph.get_edge(abs(start)).mNodeA):(mGraph.get_edge(abs(start)).mNodeB… in FindPath() 2826 …target = (Q_irand(0,1)==0)?(mGraph.get_edge(abs(target)).mNodeA):(mGraph.get_edge(abs(target)).mNo… in FindPath() 3090 start = mGraph.get_edge(abs(start)).mNodeA; in SafePathExists() [all …]
|