/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/tree/tests/ |
H A D | test_recognition.py | 49 nx.is_tree(self.graph()) 64 assert nx.is_tree(self.T2) 65 assert nx.is_tree(self.T3) 66 assert nx.is_tree(self.T5) 69 assert not nx.is_tree(self.N4) 70 assert not nx.is_tree(self.N5) 71 assert not nx.is_tree(self.N6) 95 assert not nx.is_tree(G) 99 assert not nx.is_tree(G) 105 assert not nx.is_tree(G) [all …]
|
/dports/math/gambit/gambit-16.0.1/src/python/gambit/ |
H A D | nash.py | 86 if use_strategic and game.is_tree: 90 extensive=game.is_tree and not use_strategic) 108 if use_strategic and game.is_tree: 112 extensive=game.is_tree and not use_strategic) 129 if use_strategic and game.is_tree: 183 if use_strategic and game.is_tree: 198 if use_strategic and game.is_tree: 226 if use_strategic and game.is_tree: 240 if not game.is_tree or use_strategic: 270 if not game.is_tree or use_strategic: [all …]
|
/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | tree_game.c | 25 igraph_bool_t is_tree = 0, are_connected = 0; in main() local 32 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main() 33 IGRAPH_ASSERT(is_tree); in main() 37 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main() 38 IGRAPH_ASSERT(is_tree); in main() 44 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main() 45 IGRAPH_ASSERT(is_tree); in main()
|
H A D | random_spanning_tree.c | 26 igraph_bool_t is_tree; in main() local 46 igraph_is_tree(&spanning_tree, &is_tree, NULL, IGRAPH_ALL); in main() 47 IGRAPH_ASSERT(is_tree); in main()
|
/dports/misc/otter/otter-3.3f/source/ |
H A D | is.c | 16 struct is_tree *is) in insert_is_tree() 19 struct is_tree *i1, *prev, *i3; in insert_is_tree() 96 struct is_tree *root_is) in is_insert() 98 struct is_tree *i1; in is_insert() 123 struct is_tree *is, in end_term_is() 127 struct is_tree *i1; in end_term_is() 182 struct is_tree *root_is) in is_delete() 272 struct is_tree *is, in is_retrieve() 276 struct is_tree *i1 = NULL; in is_retrieve() 395 struct is_tree *is, in fs_retrieve() [all …]
|
H A D | header.h | 291 CLASS struct is_tree *Is_pos_lits; /* positive literals */ 292 CLASS struct is_tree *Is_neg_lits; /* negative literals */ 306 CLASS struct is_tree *Weight_purge_gen_index; 307 CLASS struct is_tree *Weight_pick_given_index; 308 CLASS struct is_tree *Weight_terms_index;
|
H A D | weight.c | 43 static struct is_tree *weight_retrieve(struct term *t, in weight_retrieve() 44 struct is_tree *wt_index) in weight_retrieve() 46 struct is_tree *is; in weight_retrieve() 113 struct is_tree *wt_index) in weight() 115 struct is_tree *is; in weight() 179 struct is_tree *wt_index) in wt_match_dots() 206 struct is_tree *wt_index) in wt_match() 313 struct is_tree *wt_index) in weight_insert() 315 struct is_tree *is; in weight_insert() 353 struct is_tree *wt_index, in set_wt_list() [all …]
|
/dports/devel/R-cran-git2r/git2r/man/ |
H A D | is_tree.Rd | 3 \name{is_tree} 4 \alias{is_tree} 7 is_tree(object) 35 is_tree(commit_1) 36 is_tree(tree_1)
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/tests/ |
H A D | test_gomory_hu.py | 38 assert nx.is_tree(T) 48 assert nx.is_tree(T) 58 assert nx.is_tree(T) 68 assert nx.is_tree(T) 79 assert nx.is_tree(T) 88 assert nx.is_tree(T) 112 assert nx.is_tree(T)
|
/dports/devel/abseil/abseil-cpp-20211102.0/absl/strings/internal/ |
H A D | cord_internal.h | 435 bool is_tree() const { return (tag() & 1) != 0; } in is_tree() function 440 assert(is_tree()); in is_profiled() 449 assert(data1.is_tree() && data2.is_tree()); in is_either_profiled() 458 assert(is_tree()); in cordz_info() 469 assert(is_tree()); in set_cordz_info() 476 assert(is_tree()); in clear_cordz_info() 483 assert(!is_tree()); in as_chars() 507 assert(is_tree()); in as_tree() 522 assert(is_tree()); in set_tree() 529 assert(!is_tree()); in inline_size()
|
/dports/devel/py-grpcio/grpcio-1.43.0/third_party/abseil-cpp/absl/strings/internal/ |
H A D | cord_internal.h | 435 bool is_tree() const { return (tag() & 1) != 0; } in is_tree() function 440 assert(is_tree()); in is_profiled() 449 assert(data1.is_tree() && data2.is_tree()); in is_either_profiled() 458 assert(is_tree()); in cordz_info() 469 assert(is_tree()); in set_cordz_info() 476 assert(is_tree()); in clear_cordz_info() 483 assert(!is_tree()); in as_chars() 507 assert(is_tree()); in as_tree() 522 assert(is_tree()); in set_tree() 529 assert(!is_tree()); in inline_size()
|
/dports/graphics/R-cran-s2/s2/src/absl/strings/internal/ |
H A D | cord_internal.h | 361 bool is_tree() const { return (tag() & 1) != 0; } in is_tree() function 366 assert(is_tree()); in is_profiled() 374 assert(is_tree()); in cordz_info() 385 assert(is_tree()); in set_cordz_info() 392 assert(is_tree()); in clear_cordz_info() 399 assert(!is_tree()); in as_chars() 423 assert(is_tree()); in as_tree() 438 assert(is_tree()); in set_tree() 445 assert(!is_tree()); in inline_size() 460 assert(is_tree()); in set_profiled()
|
/dports/devel/pecl-grpc/grpc-1.42.0/third_party/abseil-cpp/absl/strings/internal/ |
H A D | cord_internal.h | 361 bool is_tree() const { return (tag() & 1) != 0; } in is_tree() function 366 assert(is_tree()); in is_profiled() 374 assert(is_tree()); in cordz_info() 385 assert(is_tree()); in set_cordz_info() 392 assert(is_tree()); in clear_cordz_info() 399 assert(!is_tree()); in as_chars() 423 assert(is_tree()); in as_tree() 438 assert(is_tree()); in set_tree() 445 assert(!is_tree()); in inline_size() 460 assert(is_tree()); in set_profiled()
|
/dports/security/git-secret/git-secret-94d5ae4/src/ |
H A D | main.sh | 7 local is_tree 8 is_tree=$(_is_inside_git_tree) 9 if [[ "$is_tree" -ne 0 ]]; then
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/stdlib/test/ |
H A D | digraph_utils_SUITE.erl | 210 false = is_tree([], []), 211 true = is_tree([a], []), 212 false = is_tree([a,b], []), 213 true = is_tree([{a,b}]), 214 false = is_tree([{a,b},{b,a}]), 218 true = is_tree([{a,c},{c,b}]), 219 true = is_tree([{b,a},{c,a}]), 251 is_tree(Es) -> function 252 is_tree([], Es). 254 is_tree(Vs, Es) -> function [all …]
|
/dports/math/maxima/maxima-5.43.2/share/graphs/ |
H A D | rtest_graphs.mac | 229 is_tree(empty_graph(0)); 232 is_tree(empty_graph(1)); 235 is_tree(empty_graph(2)); 238 is_tree(path_graph(4)); 241 is_tree(cycle_graph(4));
|
/dports/devel/libfirm/libfirm-1.21.0/ir/stat/ |
H A D | dags.c | 65 unsigned is_tree:1; /**< True if this DAG is a tree. */ member 121 entry->is_tree = 1; in new_dag_entry() 293 entry->is_tree = 0; in connect_dags() 300 entry->is_tree &= prev_entry->is_tree; in connect_dags() 391 (unsigned)entry->is_tree, in count_dags_in_graph()
|
/dports/graphics/R-cran-s2/s2/src/absl/strings/ |
H A D | cord.h | 756 bool is_tree() const { return data_.is_tree(); } in is_tree() function 943 if (is_tree()) { in InlineRep() 958 if (!is_tree() && !src.is_tree()) { 968 if (is_tree()) { 988 assert(data_.is_tree()); in as_tree() 993 if (is_tree()) { in tree() 1010 if (data_.is_tree()) { in set_tree() 1022 ABSL_ASSERT(is_tree()); in replace_tree() 1037 assert(!is_tree()); in CopyToArray() 1124 if (!contents_.is_tree() && !rhs.contents_.is_tree()) { in Compare() [all …]
|
/dports/devel/pecl-grpc/grpc-1.42.0/third_party/abseil-cpp/absl/strings/ |
H A D | cord.h | 756 bool is_tree() const { return data_.is_tree(); } in is_tree() function 943 if (is_tree()) { in InlineRep() 958 if (!is_tree() && !src.is_tree()) { 968 if (is_tree()) { 988 assert(data_.is_tree()); in as_tree() 993 if (is_tree()) { in tree() 1010 if (data_.is_tree()) { in set_tree() 1022 ABSL_ASSERT(is_tree()); in replace_tree() 1037 assert(!is_tree()); in CopyToArray() 1124 if (!contents_.is_tree() && !rhs.contents_.is_tree()) { in Compare() [all …]
|