Home
last modified time | relevance | path

Searched defs:graph_node (Results 1 – 25 of 38) sorted by relevance

12

/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
H A Dgraph.c164 void (*dfs_cb)(struct graph_node *, void *), void *arg) in _graph_dfs() argument
188 void (*dfs_cb)(struct graph_node *, void *), void *arg) in graph_dfs() argument
211 void (*pcb)(struct graph_node *, struct buffer *)) in graph_dump_dot()
/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
H A Dgraph.c164 void (*dfs_cb)(struct graph_node *, void *), void *arg) in _graph_dfs() argument
188 void (*dfs_cb)(struct graph_node *, void *), void *arg) in graph_dfs() argument
211 void (*pcb)(struct graph_node *, struct buffer *)) in graph_dump_dot()
/dports/games/frogatto/frogatto-1.3.1/src/
H A Dpathfinding.hpp39 class graph_node { class
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
/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
/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
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/include/votca/tools/
H A Dgraphalgorithm.h191 GraphNode graph_node = graph.getNode(vertex); in findStructureId() local
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/include/votca/tools/
H A Dgraphalgorithm.h191 GraphNode graph_node = graph.getNode(vertex); in findStructureId() local
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/src/libtools/
H A Dgraphvisitor.cc61 GraphNode graph_node = graph.getNode(startingVertex_); in initialize() local
H A Dgraph.cc87 void Graph::setNode(Index vertex, GraphNode& graph_node) { in setNode()
/dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/src/libtools/
H A Dgraphvisitor.cc61 GraphNode graph_node = graph.getNode(startingVertex_); in initialize() local
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/Ylib/
H A Dgraph.c96 typedef struct graph_node { struct
100 struct graph_node *predecessor; /* predecesor */ argument
101 int color;
102 int start;
103 int finish;
104 INT distance;
/dports/science/lammps/lammps-stable_29Sep2021/lib/kokkos/core/src/Cuda/
H A DKokkos_Cuda_KernelLaunch.hpp355 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
448 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
/dports/devel/kokkos/kokkos-3.4.01/core/src/Cuda/
H A DKokkos_Cuda_KernelLaunch.hpp355 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
448 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
/dports/science/sparta/sparta-20Oct2021/lib/kokkos/core/src/Cuda/
H A DKokkos_Cuda_KernelLaunch.hpp355 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
448 auto& graph_node = Impl::get_cuda_graph_node_from_kernel(driver); in create_parallel_launch_graph_node() local
/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
/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
/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
/dports/net/tshark-lite/wireshark-3.6.1/epan/dissectors/
H A Dpacket-lwapp.c88 RESULT_CODE = 1, in setNode()
89 MWAR_ADDR_PAYLOAD, in setNode()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/src/items/
H A Ditem_manager.cpp239 int graph_node = item->getGraphNode(); in insertItemInQuad() local
/dports/misc/py-tvm/incubator-tvm-0.6.1/src/relay/pass/
H A Dfuse_ops.cc672 const auto* graph_node = graph.post_dfs_order[nid]; in InitGroups() local
690 auto* graph_node = graph.post_dfs_order[nid]; in RunFuse() local
/dports/misc/tvm/incubator-tvm-0.6.1/src/relay/pass/
H A Dfuse_ops.cc672 const auto* graph_node = graph.post_dfs_order[nid]; in InitGroups() local
690 auto* graph_node = graph.post_dfs_order[nid]; in RunFuse() local
/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
693 graph_node(graph& g) : my_graph(g) { in graph_node() function
777 : graph_node(g), my_active(is_active), init_my_active(is_active), in graph_node() function
2563 graph_node(g), my_threshold(threshold), my_count(0), my_tries(0), in graph_node() function
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/relay/transforms/
H A Dfuse_ops.cc680 const auto* graph_node = graph.post_dfs_order[nid]; in InitGroups() local
696 auto* graph_node = graph.post_dfs_order[nid]; in RunFuse() local

12