Home
last modified time | relevance | path

Searched refs:graph_node (Results 1 – 25 of 117) sorted by relevance

12345

/dports/net/frr7-pythontools/frr-frr-7.5.1/lib/
H A Dgraph.h39 struct graph_node { struct
57 struct graph_node *graph_new_node(struct graph *graph, void *data, argument
72 void graph_delete_node(struct graph *graph, struct graph_node *node);
81 struct graph_node *graph_add_edge(struct graph_node *from,
82 struct graph_node *to);
90 void graph_remove_edge(struct graph_node *from, struct graph_node *to);
107 struct graph_node *graph_find_node(struct graph *graph, void *data);
117 bool graph_has_edge(struct graph_node *from, struct graph_node *to);
130 void graph_dfs(struct graph *graph, struct graph_node *start,
131 void (*dfs_cb)(struct graph_node *, void *), void *arg);
[all …]
H A Dgraph.c50 struct graph_node *node = in graph_new_node()
51 XCALLOC(MTYPE_GRAPH_NODE, sizeof(struct graph_node)); in graph_new_node()
83 struct graph_node *adj; in graph_delete_node()
116 struct graph_node *graph_add_edge(struct graph_node *from, in graph_add_edge()
117 struct graph_node *to) in graph_add_edge()
124 void graph_remove_edge(struct graph_node *from, struct graph_node *to) in graph_remove_edge()
142 struct graph_node *g; in graph_find_node()
153 bool graph_has_edge(struct graph_node *from, struct graph_node *to) in graph_has_edge()
181 struct graph_node *c = vector_slot(start->to, i); in _graph_dfs()
203 struct graph_node *adj = vector_slot(gn->to, i); in graph_dump_dot_default_print_cb()
[all …]
H A Dcommand_graph.c105 static bool cmd_nodes_link(struct graph_node *from, struct graph_node *to) in cmd_nodes_link()
113 static bool cmd_nodes_equal(struct graph_node *ga, struct graph_node *gb);
119 static inline struct graph_node *cmd_loopstop(struct graph_node *gn) in cmd_loopstop()
128 static bool cmd_subgraph_equal(struct graph_node *ga, struct graph_node *gb, in cmd_subgraph_equal()
165 static bool cmd_nodes_equal(struct graph_node *ga, struct graph_node *gb) in cmd_nodes_equal()
200 static void cmd_fork_bump_attr(struct graph_node *gn, struct graph_node *join, in cmd_fork_bump_attr()
245 struct graph_node *stop) in cmd_free_recur()
274 struct graph_node *old, struct graph_node *new, in cmd_merge_nodes()
360 static void cmd_node_names(struct graph_node *gn, struct graph_node *join, in cmd_node_names()
401 struct graph_node *tail = in cmd_node_names()
[all …]
H A Dcommand_parse.y65 struct graph_node *start, *end;
72 struct graph_node *node;
90 struct graph_node *currnode;
131 static struct graph_node *
139 struct graph_node *);
403 static bool loopcheck_inner(struct graph_node *start, struct graph_node *node,
404 struct graph_node *end, size_t depth)
484 struct graph_node *finalnode)
489 struct graph_node *end_token_node =
491 struct graph_node *end_element_node =
[all …]
H A Dcommand_match.c45 struct graph_node **, size_t);
85 struct graph_node *stack[CMD_ARGC_MAX]; in command_match()
190 struct graph_node **stack, in command_match_r()
247 struct graph_node *gn; in command_match_r()
269 struct graph_node *leaf = in command_match_r()
361 struct graph_node **gstack, **newstack; in command_complete()
408 sizeof(struct graph_node *)); in command_complete()
424 sizeof(struct graph_node *)); in command_complete()
484 struct graph_node *child; in add_nexthops()
485 struct graph_node **nextstack; in add_nexthops()
[all …]
H A Dgrammar_sandbox.c41 static void pretty_print_graph(struct vty *vty, struct graph_node *, int, int,
42 struct graph_node **, size_t);
263 struct graph_node *stack[CMD_ARGC_MAX];
311 static void cmd_graph_permute(struct list *out, struct graph_node **stack, in cmd_graph_permute()
314 struct graph_node *gn = stack[stackpos]; in cmd_graph_permute()
324 i->el = ((struct graph_node *)vector_slot(gn->to, 0))->data; in cmd_graph_permute()
335 struct graph_node *gnext = vector_slot(gn->to, i); in cmd_graph_permute()
351 struct graph_node *stack[CMD_ARGC_MAX]; in cmd_graph_permutations()
494 static void pretty_print_graph(struct vty *vty, struct graph_node *start, in pretty_print_graph()
495 int level, int desc, struct graph_node **stack, in pretty_print_graph()
[all …]
/dports/net/frr7/frr-frr-7.5.1/lib/
H A Dgraph.h39 struct graph_node { struct
57 struct graph_node *graph_new_node(struct graph *graph, void *data, argument
72 void graph_delete_node(struct graph *graph, struct graph_node *node);
81 struct graph_node *graph_add_edge(struct graph_node *from,
82 struct graph_node *to);
90 void graph_remove_edge(struct graph_node *from, struct graph_node *to);
107 struct graph_node *graph_find_node(struct graph *graph, void *data);
117 bool graph_has_edge(struct graph_node *from, struct graph_node *to);
130 void graph_dfs(struct graph *graph, struct graph_node *start,
131 void (*dfs_cb)(struct graph_node *, void *), void *arg);
[all …]
H A Dgraph.c50 struct graph_node *node = in graph_new_node()
51 XCALLOC(MTYPE_GRAPH_NODE, sizeof(struct graph_node)); in graph_new_node()
83 struct graph_node *adj; in graph_delete_node()
116 struct graph_node *graph_add_edge(struct graph_node *from, in graph_add_edge()
117 struct graph_node *to) in graph_add_edge()
124 void graph_remove_edge(struct graph_node *from, struct graph_node *to) in graph_remove_edge()
142 struct graph_node *g; in graph_find_node()
153 bool graph_has_edge(struct graph_node *from, struct graph_node *to) in graph_has_edge()
181 struct graph_node *c = vector_slot(start->to, i); in _graph_dfs()
203 struct graph_node *adj = vector_slot(gn->to, i); in graph_dump_dot_default_print_cb()
[all …]
H A Dcommand_graph.c105 static bool cmd_nodes_link(struct graph_node *from, struct graph_node *to) in cmd_nodes_link()
113 static bool cmd_nodes_equal(struct graph_node *ga, struct graph_node *gb);
119 static inline struct graph_node *cmd_loopstop(struct graph_node *gn) in cmd_loopstop()
128 static bool cmd_subgraph_equal(struct graph_node *ga, struct graph_node *gb, in cmd_subgraph_equal()
165 static bool cmd_nodes_equal(struct graph_node *ga, struct graph_node *gb) in cmd_nodes_equal()
200 static void cmd_fork_bump_attr(struct graph_node *gn, struct graph_node *join, in cmd_fork_bump_attr()
245 struct graph_node *stop) in cmd_free_recur()
274 struct graph_node *old, struct graph_node *new, in cmd_merge_nodes()
360 static void cmd_node_names(struct graph_node *gn, struct graph_node *join, in cmd_node_names()
401 struct graph_node *tail = in cmd_node_names()
[all …]
H A Dcommand_parse.y65 struct graph_node *start, *end;
72 struct graph_node *node;
90 struct graph_node *currnode;
131 static struct graph_node *
139 struct graph_node *);
403 static bool loopcheck_inner(struct graph_node *start, struct graph_node *node,
404 struct graph_node *end, size_t depth)
484 struct graph_node *finalnode)
489 struct graph_node *end_token_node =
491 struct graph_node *end_element_node =
[all …]
H A Dcommand_match.c45 struct graph_node **, size_t);
85 struct graph_node *stack[CMD_ARGC_MAX]; in command_match()
190 struct graph_node **stack, in command_match_r()
247 struct graph_node *gn; in command_match_r()
269 struct graph_node *leaf = in command_match_r()
361 struct graph_node **gstack, **newstack; in command_complete()
408 sizeof(struct graph_node *)); in command_complete()
424 sizeof(struct graph_node *)); in command_complete()
484 struct graph_node *child; in add_nexthops()
485 struct graph_node **nextstack; in add_nexthops()
[all …]
H A Dgrammar_sandbox.c41 static void pretty_print_graph(struct vty *vty, struct graph_node *, int, int,
42 struct graph_node **, size_t);
263 struct graph_node *stack[CMD_ARGC_MAX];
311 static void cmd_graph_permute(struct list *out, struct graph_node **stack, in cmd_graph_permute()
314 struct graph_node *gn = stack[stackpos]; in cmd_graph_permute()
324 i->el = ((struct graph_node *)vector_slot(gn->to, 0))->data; in cmd_graph_permute()
335 struct graph_node *gnext = vector_slot(gn->to, i); in cmd_graph_permute()
351 struct graph_node *stack[CMD_ARGC_MAX]; in cmd_graph_permutations()
494 static void pretty_print_graph(struct vty *vty, struct graph_node *start, in pretty_print_graph()
495 int level, int desc, struct graph_node **stack, in pretty_print_graph()
[all …]
/dports/games/frogatto/frogatto-1.3.1/src/
H A Dpathfinding.hpp39 class graph_node { class
41 typedef boost::shared_ptr<graph_node<N, T> > graph_node_ptr;
42 graph_node(const N& src) in graph_node() function in pathfinding::graph_node
46 graph_node(const N& src, T g, T h, graph_node_ptr parent) in graph_node() function in pathfinding::graph_node
50 bool operator< (const graph_node& rhs) const { return f_ < rhs.f_;} in operator <()
75 friend std::ostream& operator<<(std::ostream& out, const graph_node<N,T>& n) { in operator <<()
90 bool graph_node_cmp(const typename graph_node<N,T>::graph_node_ptr& lhs,
91 const typename graph_node<N,T>::graph_node_ptr& rhs);
129 …graph_node_list_[v] = boost::shared_ptr<graph_node<variant, decimal> >(new graph_node<variant, dec… in weighted_directed_graph()
144 graph_node<variant, decimal>::graph_node_ptr get_graph_node(const variant& src) { in get_graph_node()
[all …]
H A Dpathfinding.cpp80 std::deque<graph_node<variant, decimal>::graph_node_ptr> open_list; in a_star_search()
92 graph_node<variant, decimal>::graph_node_ptr current = wg->get_graph_node(src_node); in a_star_search()
118 graph_node<variant, decimal>::graph_node_ptr p = current->get_parent(); in a_star_search()
227 bool graph_node_cmp(const typename graph_node<N,T>::graph_node_ptr& lhs, in graph_node_cmp()
228 const typename graph_node<N,T>::graph_node_ptr& rhs) { in graph_node_cmp()
242 std::deque<graph_node<point, double>::graph_node_ptr> open_list; in a_star_find_path()
243 typedef std::map<point, graph_node<point, double>::graph_node_ptr> graph_node_list; in a_star_find_path()
267 …graph_node<point, double>::graph_node_ptr current = boost::shared_ptr<graph_node<point, double> >(… in a_star_find_path()
296 graph_node<point, double>::graph_node_ptr p = current->get_parent(); in a_star_find_path()
326 …graph_node<point, double>::graph_node_ptr new_node = boost::shared_ptr<graph_node<point, double> >… in a_star_find_path()
[all …]
/dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/
H A D_flow_graph_impl.h41 class graph_node; variable
46 friend class graph_node; variable
237 friend class graph_node; variable
341 graph_node *my_nodes, *my_nodes_last;
344 void register_node(graph_node *n);
345 void remove_node(graph_node *n);
390 class graph_node : no_copy {
405 graph_node* next = nullptr;
406 graph_node* prev = nullptr;
408 explicit graph_node(graph& g);
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/internal/
H A D_flow_graph_impl.h49 class graph_node; variable
54 friend class graph_node; variable
139 friend class graph_node; variable
297 typedef graph_iterator<graph, graph_node> iterator;
330 graph_node *my_nodes, *my_nodes_last;
333 void register_node(graph_node *n);
334 void remove_node(graph_node *n);
350 class graph_node : tbb::internal::no_copy {
356 graph_node *next, *prev;
358 explicit graph_node(graph& g);
[all …]
/dports/net/frr7-pythontools/frr-frr-7.5.1/tools/
H A Dpermutations.c33 void permute(struct graph_node *);
34 void pretty_print_graph(struct graph_node *start, int level);
55 void permute(struct graph_node *start) in permute()
62 struct graph_node *gnn; in permute()
68 struct graph_node *gn = vector_slot(start->to, i); in permute()
/dports/net/frr7/frr-frr-7.5.1/tools/
H A Dpermutations.c33 void permute(struct graph_node *);
34 void pretty_print_graph(struct graph_node *start, int level);
55 void permute(struct graph_node *start) in permute()
62 struct graph_node *gnn; in permute()
68 struct graph_node *gn = vector_slot(start->to, i); in permute()
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/internal/
H A D_flow_graph_impl.h88 class graph_node; variable
93 friend class graph_node; variable
212 friend class tbb::flow::interface11::graph_node;
383 …typedef tbb::flow::interface11::graph_iterator<graph, tbb::flow::interface11::graph_node> iterator;
418 tbb::flow::interface11::graph_node *my_nodes, *my_nodes_last;
421 void register_node(tbb::flow::interface11::graph_node *n);
422 void remove_node(tbb::flow::interface11::graph_node *n);
454 class graph_node : tbb::internal::no_copy {
465 graph_node *next, *prev;
467 explicit graph_node(graph& g);
[all …]
/dports/devel/tbb/oneTBB-2020.3/include/tbb/internal/
H A D_flow_graph_impl.h88 class graph_node; variable
93 friend class graph_node; variable
212 friend class tbb::flow::interface11::graph_node;
383 …typedef tbb::flow::interface11::graph_iterator<graph, tbb::flow::interface11::graph_node> iterator;
418 tbb::flow::interface11::graph_node *my_nodes, *my_nodes_last;
421 void register_node(tbb::flow::interface11::graph_node *n);
422 void remove_node(tbb::flow::interface11::graph_node *n);
454 class graph_node : tbb::internal::no_copy {
465 graph_node *next, *prev;
467 explicit graph_node(graph& g);
[all …]
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/internal/
H A D_flow_graph_impl.h88 class graph_node; variable
93 friend class graph_node; variable
212 friend class tbb::flow::interface11::graph_node;
383 …typedef tbb::flow::interface11::graph_iterator<graph, tbb::flow::interface11::graph_node> iterator;
418 tbb::flow::interface11::graph_node *my_nodes, *my_nodes_last;
421 void register_node(tbb::flow::interface11::graph_node *n);
422 void remove_node(tbb::flow::interface11::graph_node *n);
454 class graph_node : tbb::internal::no_copy {
465 graph_node *next, *prev;
467 explicit graph_node(graph& g);
[all …]
/dports/sysutils/conan/conan-1.44.0/conans/model/
H A Dgraph_lock.py289 for graph_node in deps_graph.nodes:
290 if graph_node.recipe == RECIPE_VIRTUAL:
296 for edge in graph_node.dependencies:
303 reqs = getattr(graph_node.conanfile, "python_requires", {})
315 python_reqs = graph_node.conanfile.python_requires.all_refs()
317 ref = graph_node.ref if graph_node.ref and graph_node.ref.name else None
319 prev = graph_node.prev if ref and ref.revision else None
321 modified = graph_node.graph_lock_node.modified if graph_node.graph_lock_node else None
324 graph_node.path, self._revisions_enabled, graph_node.context,
327 graph_node.graph_lock_node = lock_node
[all …]
/dports/devel/py-poetry-core/poetry-core-1.0.7/poetry/core/_vendor/lark/parsers/
H A Dearley_forest.py381 …graph_node = self.pydot.Node(graph_node_id, style=graph_node_style, fillcolor="#{:06x}".format(gra…
382 self.graph.add_node(graph_node)
390 …graph_node = self.pydot.Node(graph_node_id, style=graph_node_style, fillcolor="#{:06x}".format(gra…
391 self.graph.add_node(graph_node)
396 graph_node = self.graph.get_node(graph_node_id)[0]
401 self.graph.add_edge(self.pydot.Edge(graph_node, child_graph_node))
409 … self.graph.add_edge(self.pydot.Edge(graph_node, child_graph_node, style=child_edge_style))
420 …graph_node = self.pydot.Node(graph_node_id, style=graph_node_style, fillcolor="#{:06x}".format(gra…
421 self.graph.add_node(graph_node)
426 graph_node = self.graph.get_node(graph_node_id)[0]
[all …]
/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/
H A Dflow_graph.h389 class graph_node; variable
394 friend class graph_node; variable
461 friend class graph_node; variable
691 graph_node *next, *prev;
696 virtual ~graph_node() { in ~graph_node()
762 using graph_node::my_graph;
992 using graph_node::my_graph;
1108 public graph_node,
1139 graph_node(other.graph_node::my_graph), base_type(other) { in multifunction_node()
1178 graph_node(other.graph_node::my_graph), base_type(other, new queue_type()) { in multifunction_node()
[all …]
/dports/science/py-dlib/dlib-19.22/examples/
H A Dbayes_net_gui_ex.cpp292 node_type& node = graph_drawer.graph_node(selected_node_index); in load_selected_node_tables_into_ppt_grid()
337 node_type& node = graph_drawer.graph_node(selected_node_index); in load_selected_node_tables_into_cpt_grid()
415 node_type& node = graph_drawer.graph_node(index); in initialize_node_cpt_if_necessary()
659 node_type& node = graph_drawer.graph_node(selected_node_index); in on_sel_node_evidence_modified()
702 node_type& node = graph_drawer.graph_node(selected_node_index); in on_sel_node_num_values_modified()
753 node_type& node = graph_drawer.graph_node(selected_node_index); in on_cpt_grid_modified()
887 node_type& node = graph_drawer.graph_node(n); in on_node_selected()
912 if (graph_drawer.graph_node(n).data.is_evidence()) in on_node_selected()
916 sel_node_evidence.set_text(cast_to_string(graph_drawer.graph_node(n).data.value())); in on_node_selected()
942 graph_drawer.graph_node(selected_node_index).data.set_as_evidence(); in on_evidence_toggled()
[all …]

12345