| /dports/science/py-dlib/dlib-19.22/examples/ |
| H A D | bayes_net_from_disk_ex.cpp | 53 join_tree_type join_tree; in main() local
59 create_moral_graph(bn, join_tree); in main()
60 create_join_tree(join_tree, join_tree); in main()
65 bayesian_network_join_tree solution(bn, join_tree); in main()
|
| H A D | bayes_net_ex.cpp | 173 join_tree_type join_tree; in main() local
179 create_moral_graph(bn, join_tree); in main()
180 create_join_tree(join_tree, join_tree); in main()
185 bayesian_network_join_tree solution(bn, join_tree); in main()
210 bayesian_network_join_tree solution_with_evidence(bn, join_tree); in main()
|
| H A D | bayes_net_gui_ex.cpp | 128 join_tree_type join_tree; member in main_window
498 create_moral_graph(graph_drawer.graph(), join_tree); in recalculate_probabilities()
499 create_join_tree(join_tree, join_tree); in recalculate_probabilities()
504 solution.reset(new bayesian_network_join_tree(graph_drawer.graph(), join_tree)); in recalculate_probabilities()
|
| /dports/science/dlib-cpp/dlib-19.22/examples/ |
| H A D | bayes_net_from_disk_ex.cpp | 53 join_tree_type join_tree; in main() local
59 create_moral_graph(bn, join_tree); in main()
60 create_join_tree(join_tree, join_tree); in main()
65 bayesian_network_join_tree solution(bn, join_tree); in main()
|
| H A D | bayes_net_ex.cpp | 173 join_tree_type join_tree; in main() local
179 create_moral_graph(bn, join_tree); in main()
180 create_join_tree(join_tree, join_tree); in main()
185 bayesian_network_join_tree solution(bn, join_tree); in main()
210 bayesian_network_join_tree solution_with_evidence(bn, join_tree); in main()
|
| H A D | bayes_net_gui_ex.cpp | 128 join_tree_type join_tree; member in main_window
498 create_moral_graph(graph_drawer.graph(), join_tree); in recalculate_probabilities()
499 create_join_tree(join_tree, join_tree); in recalculate_probabilities()
504 solution.reset(new bayesian_network_join_tree(graph_drawer.graph(), join_tree)); in recalculate_probabilities()
|
| /dports/science/py-dlib/dlib-19.22/dlib/graph_utils/ |
| H A D | graph_utils.h | 964 join_tree_type& join_tree in create_join_tree() argument
986 copy_graph_structure(g, join_tree); in create_join_tree()
997 join_tree.set_number_of_nodes(cliques.size()); in create_join_tree()
1003 s.swap(join_tree.node(i).data); in create_join_tree()
1014 join_tree.node(i).data, in create_join_tree()
1015 join_tree.node(j).data, in create_join_tree()
1020 join_tree.add_edge(i,j); in create_join_tree()
1021 edge(join_tree,i,j).swap(e); in create_join_tree()
1158 const join_tree_type& join_tree in is_join_tree() argument
1179 if (graph_is_connected(join_tree) == false) in is_join_tree()
[all …]
|
| H A D | graph_utils_abstract.h | 385 const join_tree_type& join_tree
431 join_tree_type& join_tree
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/graph_utils/ |
| H A D | graph_utils.h | 964 join_tree_type& join_tree in create_join_tree() argument
986 copy_graph_structure(g, join_tree); in create_join_tree()
997 join_tree.set_number_of_nodes(cliques.size()); in create_join_tree()
1003 s.swap(join_tree.node(i).data); in create_join_tree()
1014 join_tree.node(i).data, in create_join_tree()
1015 join_tree.node(j).data, in create_join_tree()
1020 join_tree.add_edge(i,j); in create_join_tree()
1021 edge(join_tree,i,j).swap(e); in create_join_tree()
1158 const join_tree_type& join_tree in is_join_tree() argument
1179 if (graph_is_connected(join_tree) == false) in is_join_tree()
[all …]
|
| H A D | graph_utils_abstract.h | 385 const join_tree_type& join_tree
431 join_tree_type& join_tree
|
| /dports/science/py-dlib/dlib-19.22/dlib/bayes_utils/ |
| H A D | bayes_utils.h | 1226 const U& join_tree in bnjt_impl() argument
1242 … if (join_tree.node(n).data.is_member(i) && join_tree.node(n).data.size() < size) in bnjt_impl()
1244 size = join_tree.node(n).data.size(); in bnjt_impl()
1304 const U& join_tree, in pass_join_tree_message() argument
1365 const U& join_tree, in create_bayesian_network_join_tree() argument
1380 copy_graph_structure(join_tree, bn_join_tree); in create_bayesian_network_join_tree()
1410 join_tree.node(i).data.reset(); in create_bayesian_network_join_tree()
1411 while (join_tree.node(i).data.move_next()) in create_bayesian_network_join_tree()
1448 join_tree.node(i).data.reset(); in create_bayesian_network_join_tree()
1592 const U& join_tree in bayesian_network_join_tree() argument
[all …]
|
| H A D | bayes_utils_abstract.h | 973 const join_tree_type& join_tree
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/bayes_utils/ |
| H A D | bayes_utils.h | 1226 const U& join_tree in bnjt_impl() argument
1242 … if (join_tree.node(n).data.is_member(i) && join_tree.node(n).data.size() < size) in bnjt_impl()
1244 size = join_tree.node(n).data.size(); in bnjt_impl()
1304 const U& join_tree, in pass_join_tree_message() argument
1365 const U& join_tree, in create_bayesian_network_join_tree() argument
1380 copy_graph_structure(join_tree, bn_join_tree); in create_bayesian_network_join_tree()
1410 join_tree.node(i).data.reset(); in create_bayesian_network_join_tree()
1411 while (join_tree.node(i).data.move_next()) in create_bayesian_network_join_tree()
1448 join_tree.node(i).data.reset(); in create_bayesian_network_join_tree()
1592 const U& join_tree in bayesian_network_join_tree() argument
[all …]
|
| H A D | bayes_utils_abstract.h | 973 const join_tree_type& join_tree
|
| /dports/science/py-dlib/dlib-19.22/dlib/test/ |
| H A D | bayes_nets.cpp | 235 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1b_c>::kernel_1a_c join_tree; in bayes_nets_test() local
237 create_moral_graph(bn, join_tree); in bayes_nets_test()
238 create_join_tree(join_tree, join_tree); in bayes_nets_test()
240 bayesian_network_join_tree solution(bn, join_tree); in bayes_nets_test()
289 bayesian_network_join_tree(bn, join_tree).swap(solution); in bayes_nets_test()
368 create_moral_graph(bn, join_tree); in bayes_nets_test()
369 create_join_tree(join_tree, join_tree); in bayes_nets_test()
370 bayesian_network_join_tree(bn, join_tree).swap(solution); in bayes_nets_test()
|
| H A D | graph.cpp | 278 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1b_c>::kernel_1a_c join_tree; in graph_test() local
283 create_join_tree(a, join_tree); in graph_test()
284 DLIB_TEST(join_tree.number_of_nodes() == 6); in graph_test()
285 DLIB_TEST(graph_is_connected(join_tree) == true); in graph_test()
286 DLIB_TEST(graph_contains_undirected_cycle(join_tree) == false); in graph_test()
287 DLIB_TEST(is_join_tree(a, join_tree)); in graph_test()
|
| H A D | directed_graph.cpp | 386 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1a_c>::kernel_1a_c join_tree; in directed_graph_test() local
389 create_join_tree(g, join_tree); in directed_graph_test()
390 DLIB_TEST(is_join_tree(g, join_tree)); in directed_graph_test()
391 DLIB_TEST(join_tree.number_of_nodes() == 2); in directed_graph_test()
392 DLIB_TEST(graph_contains_undirected_cycle(join_tree) == false); in directed_graph_test()
393 DLIB_TEST(graph_is_connected(join_tree) == true); in directed_graph_test()
407 DLIB_TEST(sos.is_member(join_tree.node(0).data)); in directed_graph_test()
408 DLIB_TEST(sos.is_member(join_tree.node(1).data)); in directed_graph_test()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
| H A D | bayes_nets.cpp | 235 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1b_c>::kernel_1a_c join_tree; in bayes_nets_test() local
237 create_moral_graph(bn, join_tree); in bayes_nets_test()
238 create_join_tree(join_tree, join_tree); in bayes_nets_test()
240 bayesian_network_join_tree solution(bn, join_tree); in bayes_nets_test()
289 bayesian_network_join_tree(bn, join_tree).swap(solution); in bayes_nets_test()
368 create_moral_graph(bn, join_tree); in bayes_nets_test()
369 create_join_tree(join_tree, join_tree); in bayes_nets_test()
370 bayesian_network_join_tree(bn, join_tree).swap(solution); in bayes_nets_test()
|
| H A D | graph.cpp | 278 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1b_c>::kernel_1a_c join_tree; in graph_test() local
283 create_join_tree(a, join_tree); in graph_test()
284 DLIB_TEST(join_tree.number_of_nodes() == 6); in graph_test()
285 DLIB_TEST(graph_is_connected(join_tree) == true); in graph_test()
286 DLIB_TEST(graph_contains_undirected_cycle(join_tree) == false); in graph_test()
287 DLIB_TEST(is_join_tree(a, join_tree)); in graph_test()
|
| H A D | directed_graph.cpp | 386 …::set<unsigned long>::compare_1b_c, dlib::set<unsigned long>::compare_1a_c>::kernel_1a_c join_tree; in directed_graph_test() local
389 create_join_tree(g, join_tree); in directed_graph_test()
390 DLIB_TEST(is_join_tree(g, join_tree)); in directed_graph_test()
391 DLIB_TEST(join_tree.number_of_nodes() == 2); in directed_graph_test()
392 DLIB_TEST(graph_contains_undirected_cycle(join_tree) == false); in directed_graph_test()
393 DLIB_TEST(graph_is_connected(join_tree) == true); in directed_graph_test()
407 DLIB_TEST(sos.is_member(join_tree.node(0).data)); in directed_graph_test()
408 DLIB_TEST(sos.is_member(join_tree.node(1).data)); in directed_graph_test()
|
| /dports/math/py-yt/yt-4.0.1/yt/utilities/lib/ |
| H A D | contour_finding.pyx | 227 def add_joins(self, np.ndarray[np.int64_t, ndim=2] join_tree):
234 n = join_tree.shape[0]
239 cid1 = join_tree[i, 0]
240 cid2 = join_tree[i, 1]
|
| /dports/lang/swi-pl/swipl-8.2.3/packages/cql/ |
| H A D | cql.pl | 2938 query(Join, _, top_level_query) % Only bother doing join_tree for top_level_queries
|