Home
last modified time | relevance | path

Searched refs:edge_t (Results 1 – 25 of 849) sorted by relevance

12345678910>>...34

/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dfind_flow_cost_bundled_properties_and_named_params_test.cpp9 struct edge_t { struct
21 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
58 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
59 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
60 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
61 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
H A Dmax_flow_algorithms_bundled_properties_and_named_params.cpp10 struct edge_t { struct
23 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dfind_flow_cost_bundled_properties_and_named_params_test.cpp9 struct edge_t { struct
21 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
58 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
59 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
60 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
61 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
H A Dmax_flow_algorithms_bundled_properties_and_named_params.cpp10 struct edge_t { struct
23 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dfind_flow_cost_bundled_properties_and_named_params_test.cpp9 struct edge_t { struct
21 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
58 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
59 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
60 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
61 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
H A Dmax_flow_algorithms_bundled_properties_and_named_params.cpp10 struct edge_t { struct
23 typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t > Graph; argument
30 boost::property_map<Graph,double edge_t::* >::type capacity = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
31 boost::property_map<Graph,float edge_t::* >::type cost = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
32 …boost::property_map<Graph,float edge_t::* >::type residual_capacity = get(&edge_t::residual_capaci… in BOOST_AUTO_TEST_CASE()
33 …boost::property_map<Graph,traits::edge_descriptor edge_t::* >::type rev = get(&edge_t::reversed_ed… in BOOST_AUTO_TEST_CASE()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dfind_flow_cost_bundled_properties_and_named_params_test.cpp12 struct edge_t struct
27 node_t, edge_t > argument
38 = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
39 boost::property_map< Graph, float edge_t::* >::type cost in BOOST_AUTO_TEST_CASE()
40 = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
42 = get(&edge_t::residual_capacity, g); in BOOST_AUTO_TEST_CASE()
44 = get(&edge_t::reversed_edge, g); in BOOST_AUTO_TEST_CASE()
74 = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
76 = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
78 = get(&edge_t::residual_capacity, g); in BOOST_AUTO_TEST_CASE()
[all …]
H A Dmax_flow_algorithms_bundled_properties_and_named_params.cpp13 struct edge_t struct
29 node_t, edge_t > argument
38 boost::property_map< Graph, double edge_t::* >::type capacity in BOOST_AUTO_TEST_CASE()
39 = get(&edge_t::capacity, g); in BOOST_AUTO_TEST_CASE()
40 boost::property_map< Graph, float edge_t::* >::type cost in BOOST_AUTO_TEST_CASE()
41 = get(&edge_t::cost, g); in BOOST_AUTO_TEST_CASE()
42 boost::property_map< Graph, float edge_t::* >::type residual_capacity in BOOST_AUTO_TEST_CASE()
43 = get(&edge_t::residual_capacity, g); in BOOST_AUTO_TEST_CASE()
44 boost::property_map< Graph, traits::edge_descriptor edge_t::* >::type rev in BOOST_AUTO_TEST_CASE()
45 = get(&edge_t::reversed_edge, g); in BOOST_AUTO_TEST_CASE()
/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/
H A Dfastgr.c25 edge_t *e; in ffe()
74 edge_t *fast_edge(edge_t * e) in fast_edge()
78 edge_t *f; in fast_edge()
126 edge_t *f; in safe_delete_fast_edge()
162 edge_t *new_virtual_edge(node_t * u, node_t * v, edge_t * orig) in new_virtual_edge()
164 edge_t *e; in new_virtual_edge()
199 edge_t *virtual_edge(node_t * u, node_t * v, edge_t * orig) in virtual_edge()
295 edge_t *e, *f; in fastgr()
326 basic_merge(edge_t * e, edge_t * rep) in basic_merge()
339 merge_oneway(edge_t * e, edge_t * rep) in merge_oneway()
[all …]
/dports/security/tinc/tinc-1.0.36/src/
H A Dedge.c33 static int edge_compare(const edge_t *a, const edge_t *b) { in edge_compare()
37 static int edge_weight_compare(const edge_t *a, const edge_t *b) { in edge_weight_compare()
73 edge_t *new_edge(void) { in new_edge()
74 return xmalloc_and_zero(sizeof(edge_t)); in new_edge()
77 void free_edge(edge_t *e) { in free_edge()
83 void edge_add(edge_t *e) { in edge_add()
94 void edge_del(edge_t *e) { in edge_del()
103 edge_t *lookup_edge(node_t *from, node_t *to) { in lookup_edge()
104 edge_t v; in lookup_edge()
115 edge_t *e; in dump_edges()
H A Dedge.h29 typedef struct edge_t { struct
38 struct edge_t *reverse; /* edge in the opposite direction, if available */ argument
39 } edge_t; typedef
45 extern edge_t *new_edge(void) __attribute__((__malloc__));
46 extern void free_edge(edge_t *e);
49 extern void edge_add(edge_t *e);
50 extern void edge_del(edge_t *e);
51 extern edge_t *lookup_edge(struct node_t *from, struct node_t *to);
/dports/security/tinc-devel/tinc-1.1pre18/src/
H A Dedge.c34 static int edge_compare(const edge_t *a, const edge_t *b) { in edge_compare()
38 static int edge_weight_compare(const edge_t *a, const edge_t *b) { in edge_weight_compare()
74 edge_t *new_edge(void) { in new_edge()
75 return xzalloc(sizeof(edge_t)); in new_edge()
78 void free_edge(edge_t *e) { in free_edge()
85 void edge_add(edge_t *e) { in edge_add()
108 void edge_del(edge_t *e) { in edge_del()
117 edge_t *lookup_edge(node_t *from, node_t *to) { in lookup_edge()
118 edge_t v; in lookup_edge()
128 for splay_each(edge_t, e, n->edge_tree) { in dump_edges()
H A Dedge.h29 typedef struct edge_t { struct
39 struct edge_t *reverse; /* edge in the opposite direction, if available */ argument
40 } edge_t; typedef
46 extern edge_t *new_edge(void) __attribute__((__malloc__));
47 extern void free_edge(edge_t *e);
50 extern void edge_add(edge_t *e);
51 extern void edge_del(edge_t *e);
52 extern edge_t *lookup_edge(struct node_t *from, struct node_t *to);
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Drender.h72 extern double arrow_length(edge_t * e, int flag);
84 extern void clip_and_install(edge_t * fe, node_t * hn,
116 extern splines *getsplinepoints(edge_t * e);
118 extern void gv_free_splines(edge_t * e);
124 extern void makeSelfEdge(path * P, edge_t * edges[], int ind, int cnt,
127 extern bezier *new_spline(edge_t * e, int sz);
130 extern int place_portlabel(edge_t * e, boolean head_p);
131 extern void makePortLabels(edge_t * e);
132 extern pointf edgeMidpoint(graph_t* g, edge_t * e);
138 extern void resolvePorts (edge_t* e);
[all …]
/dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/GTpo/src/gtpo/
H A Dnode_behaviour.hpp41 template < class node_t, class edge_t >
42 …< config_t >::notify_in_node_inserted( node_t target, node_t node, const edge_t& edge ) noexcept -… in notify_in_node_inserted()
48 template < class node_t, class edge_t >
49 …e< config_t >::notify_in_node_removed( node_t target, node_t node, const edge_t& edge ) noexcept -… in notify_in_node_removed()
62 template < class node_t, class edge_t >
63 … config_t >::notify_out_node_inserted( node_t target, node_t node, const edge_t& edge ) noexcept -… in notify_out_node_inserted()
69 template < class node_t, class edge_t >
70 …< config_t >::notify_out_node_removed( node_t target, node_t node, const edge_t& edge ) noexcept -… in notify_out_node_removed()
/dports/games/libretro-tyrquake/tyrquake-e76477d/common/
H A Dr_edge.c39 edge_t *auxedges;
48 edge_t *newedges[MAXHEIGHT];
49 edge_t *removeedges[MAXHEIGHT];
62 edge_t edge_head;
63 edge_t edge_tail;
64 edge_t edge_aftertail;
65 edge_t edge_sentinel;
124 void R_InsertNewEdges(edge_t *edgestoadd, edge_t *edgelist) in R_InsertNewEdges()
126 edge_t *next_edge; in R_InsertNewEdges()
494 edge_t *edge; in R_GenerateSpans()
[all …]
H A Dr_local.h131 void R_InsertNewEdges(edge_t *edgestoadd, edge_t *edgelist);
132 void R_StepActiveU(edge_t *pedge);
133 void R_RemoveEdges(edge_t *pedge);
198 extern edge_t *auxedges;
200 extern edge_t *r_edges, *edge_p, *edge_max;
202 extern edge_t *newedges[MAXHEIGHT];
203 extern edge_t *removeedges[MAXHEIGHT];
208 extern edge_t edge_head;
209 extern edge_t edge_tail;
210 extern edge_t edge_aftertail;
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Ddigraph.h45 typedef typename GraphTraits::edge_t edge_t; typedef
51 auto_vec<edge_t *> m_preds;
52 auto_vec<edge_t *> m_succs;
84 typedef typename GraphTraits::edge_t edge_t; typedef
102 void add_edge (edge_t *edge);
105 auto_delete_vec<edge_t> m_edges;
181 edge_t *e; in dump_dot_to_pp()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
/dports/games/tenebrae/tenebrae_0/
H A Dr_edge.c37 edge_t *auxedges;
46 edge_t *newedges[MAXHEIGHT];
47 edge_t *removeedges[MAXHEIGHT];
61 edge_t edge_head;
62 edge_t edge_tail;
63 edge_t edge_aftertail;
64 edge_t edge_sentinel;
173 void R_InsertNewEdges (edge_t *edgestoadd, edge_t *edgelist) in R_InsertNewEdges()
175 edge_t *next_edge; in R_InsertNewEdges()
590 edge_t *edge; in R_GenerateSpans()
[all …]

12345678910>>...34