| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/traversal/tests/ |
| H A D | test_dfs.py | 36 T = nx.dfs_tree(self.G, source=0)
40 T = nx.dfs_tree(self.G, source=None)
44 T = nx.dfs_tree(self.G)
68 T = nx.dfs_tree(G, source=1)
71 T = nx.dfs_tree(G, source=None)
133 T = nx.dfs_tree(self.G, source=3, depth_limit=1)
|
| /dports/math/nauty/nauty27r3/ |
| H A D | planarity.c | 88 sparseg_dlcl_delete(dfs_tree, n); in sparseg_adjl_plan_and_iso()
2628 te_l = (*dfs_tree)[v]; in sparseg_adjl_is_planar()
7095 sparseg_dlcl_print(*dfs_tree, n); in embedg_planar_alg_init()
7252 te_l = (*dfs_tree)[i]; in embedg_planar_alg_init()
8058 sparseg_dlcl_delete(*dfs_tree, n); in sparseg_adjl_dfs_preprocessing()
8059 *dfs_tree = new_dfs_tree; in sparseg_adjl_dfs_preprocessing()
9145 tree_l = dfs_tree[v]; in embedg_get_least_neigh()
9473 embedg_add_mark_u_x(dfs_tree, back_edges, in embedg_mark_minor_A()
9476 embedg_add_mark_u_x(dfs_tree, back_edges, in embedg_mark_minor_A()
9479 embedg_add_mark_v_w(dfs_tree, back_edges, in embedg_mark_minor_A()
[all …]
|
| H A D | planarg.c | 139 t_dlcl **dfs_tree, **back_edges, **mult_edges; in isplanar() local
145 &dfs_tree, &back_edges, &mult_edges, in isplanar()
150 embedg_obstruction(V, A, dfs_tree, back_edges, in isplanar()
160 sparseg_dlcl_delete(dfs_tree, n); in isplanar()
|
| /dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/ |
| H A D | planarity.c | 88 sparseg_dlcl_delete(dfs_tree, n); in sparseg_adjl_plan_and_iso()
2628 te_l = (*dfs_tree)[v]; in sparseg_adjl_is_planar()
7095 sparseg_dlcl_print(*dfs_tree, n); in embedg_planar_alg_init()
7252 te_l = (*dfs_tree)[i]; in embedg_planar_alg_init()
8058 sparseg_dlcl_delete(*dfs_tree, n); in sparseg_adjl_dfs_preprocessing()
8059 *dfs_tree = new_dfs_tree; in sparseg_adjl_dfs_preprocessing()
9145 tree_l = dfs_tree[v]; in embedg_get_least_neigh()
9473 embedg_add_mark_u_x(dfs_tree, back_edges, in embedg_mark_minor_A()
9476 embedg_add_mark_u_x(dfs_tree, back_edges, in embedg_mark_minor_A()
9479 embedg_add_mark_v_w(dfs_tree, back_edges, in embedg_mark_minor_A()
[all …]
|
| H A D | planarg.c | 138 t_dlcl **dfs_tree, **back_edges, **mult_edges; in isplanar() local
144 &dfs_tree, &back_edges, &mult_edges, in isplanar()
149 embedg_obstruction(V, A, dfs_tree, back_edges, in isplanar()
159 sparseg_dlcl_delete(dfs_tree, n); in isplanar()
|
| /dports/math/py-networkx/networkx-2.6.3/doc/reference/algorithms/ |
| H A D | traversal.rst | 18 dfs_tree
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/traversal/ |
| H A D | depth_first_search.py | 97 def dfs_tree(G, source=None, depth_limit=None): function
|
| /dports/net-im/tdlib/td-a53cb30e99f937cfd64e0266fa558785a184a553/tdtl/td/tl/ |
| H A D | tl_generate.cpp | 457 static void dfs_tree(const tl_tree *t, std::set<std::string> &found, const TL_writer &w) { in dfs_tree() function
463 dfs_tree(arr->args[i].type, found, w); in dfs_tree()
469 dfs_tree(tree_type->children[i], found, w); in dfs_tree()
486 dfs_tree(constructor->args[i].type, found, w); in dfs_combinator()
611 dfs_tree(t->result, result_types, w); in write_tl()
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/community/ |
| H A D | lukes.py | 86 t_G = nx.dfs_tree(G, root)
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
| H A D | lowest_common_ancestors.py | 231 spanning_tree = nx.dfs_tree(G, root)
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/connectivity/ |
| H A D | edge_augmentation.py | 954 TR = nx.dfs_tree(C, root)
|
| /dports/math/py-networkx/networkx-2.6.3/doc/release/ |
| H A D | release_2.0.rst | 408 - Set default source=None for dfs_tree (#2149)
|
| H A D | old_release_log.rst | 666 - dfs_preorder, dfs_postorder, dfs_tree, dfs_successor, dfs_predecessor
|