Home
last modified time | relevance | path

Searched refs:prufer (Results 1 – 25 of 28) sorted by relevance

12

/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_from_prufer.c12 igraph_vector_int_t prufer; in main() local
15 igraph_vector_int_view(&prufer, prufer1, sizeof(prufer1) / sizeof(igraph_integer_t)); in main()
16 igraph_from_prufer(&graph, &prufer); in main()
22 igraph_vector_int_view(&prufer, prufer2, sizeof(prufer2) / sizeof(igraph_integer_t)); in main()
23 igraph_from_prufer(&graph, &prufer); in main()
31 igraph_vector_int_init(&prufer, 0); in main()
32 igraph_from_prufer(&graph, &prufer); in main()
37 igraph_vector_int_destroy(&prufer); in main()
H A Digraph_to_prufer.c31 igraph_integer_t prufer[] = {2, 3, 2, 3}; in test_from_prufer_back_to_prufer() local
37 igraph_vector_int_view(&expected_prufer, prufer, 4); in test_from_prufer_back_to_prufer()
53 igraph_integer_t prufer[] = {0, 2, 4, 1, 1, 0}; in test_from_prufer_back_to_prufer_with_resize() local
59 igraph_vector_int_view(&expected_prufer, prufer, 6); in test_from_prufer_back_to_prufer_with_resize()
75 igraph_integer_t prufer[] = {2, 4, 5, 1, 3}; in test_from_prufer_back_to_prufer_with_resize2() local
81 igraph_vector_int_view(&expected_prufer, prufer, 5); in test_from_prufer_back_to_prufer_with_resize2()
96 int random_tree(int size, igraph_t* tree, igraph_vector_int_t* prufer) { in random_tree() argument
109 IGRAPH_CHECK(igraph_vector_int_resize(prufer, prufer_length)); in random_tree()
113 VECTOR(*prufer)[i] = j; in random_tree() local
116 IGRAPH_CHECK(igraph_from_prufer(tree, prufer)); in random_tree()
/dports/math/igraph/igraph-0.9.5/src/games/
H A Dtree.c37 igraph_vector_int_t prufer; in igraph_i_tree_game_prufer() local
44 IGRAPH_CHECK(igraph_vector_int_init(&prufer, n - 2)); in igraph_i_tree_game_prufer()
45 IGRAPH_FINALLY(igraph_vector_int_destroy, &prufer); in igraph_i_tree_game_prufer()
50 VECTOR(prufer)[i] = RNG_INTEGER(0, n - 1); in igraph_i_tree_game_prufer() local
55 IGRAPH_CHECK(igraph_from_prufer(graph, &prufer)); in igraph_i_tree_game_prufer()
57 igraph_vector_int_destroy(&prufer); in igraph_i_tree_game_prufer()
/dports/math/igraph/igraph-0.9.5/src/constructors/
H A Dprufer.c53 int igraph_from_prufer(igraph_t *graph, const igraph_vector_int_t *prufer) { in igraph_from_prufer() argument
61 n = igraph_vector_int_size(prufer) + 2; in igraph_from_prufer()
68 long u = VECTOR(*prufer)[i]; in igraph_from_prufer()
84 v = VECTOR(*prufer)[k]; /* parent of u */ in igraph_from_prufer()
/dports/math/py-Diofant/Diofant-0.13.0/docs/modules/combinatorics/
H A Dprufer.rst1 .. _combinatorics-prufer:
6 .. module:: diofant.combinatorics.prufer
H A Dindex.rst16 prufer
/dports/math/py-sympy/sympy-1.9/doc/src/modules/combinatorics/
H A Dprufer.rst1 .. _combinatorics-prufer:
6 .. module:: sympy.combinatorics.prufer
H A Dindex.rst17 prufer.rst
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/
H A Dprufer.py192 def to_tree(prufer): argument
217 n = len(prufer) + 2
219 for p in prufer:
221 for i in prufer:
H A D__init__.py2 from sympy.combinatorics.prufer import Prufer
/dports/math/py-Diofant/Diofant-0.13.0/diofant/combinatorics/
H A Dprufer.py187 def to_tree(prufer): argument
211 n = len(prufer) + 2
213 for p in prufer:
215 for i in prufer:
H A D__init__.py16 from .prufer import Prufer
/dports/math/igraph/igraph-0.9.5/include/
H A Digraph_conversion.h62 IGRAPH_EXPORT int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t *prufer);
H A Digraph_constructors.h57 IGRAPH_EXPORT int igraph_from_prufer(igraph_t *graph, const igraph_vector_int_t *prufer);
/dports/math/R-cran-igraph/igraph/src/include/
H A Digraph_conversion.h62 DECLDIR int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t *prufer);
H A Digraph_constructors.h56 DECLDIR int igraph_from_prufer(igraph_t *graph, const igraph_vector_int_t *prufer);
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/tests/
H A Dtest_prufer.py1 from sympy.combinatorics.prufer import Prufer
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dconversion.c922 int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t* prufer) { in igraph_to_prufer() argument
946 IGRAPH_CHECK(igraph_vector_int_resize(prufer, n - 2)); in igraph_to_prufer()
981 VECTOR(*prufer)[prufer_index] = neighbor; in igraph_to_prufer() local
/dports/math/R-cran-igraph/igraph/src/
H A Dconversion.c880 int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t* prufer) { in igraph_to_prufer() argument
904 IGRAPH_CHECK(igraph_vector_int_resize(prufer, n - 2)); in igraph_to_prufer()
939 VECTOR(*prufer)[prufer_index] = neighbor; in igraph_to_prufer() local
H A Dstructure_generators.c2400 int igraph_from_prufer(igraph_t *graph, const igraph_vector_int_t *prufer) { in igraph_from_prufer() argument
2408 n = igraph_vector_int_size(prufer) + 2; in igraph_from_prufer()
2415 long u = VECTOR(*prufer)[i]; in igraph_from_prufer()
2431 v = VECTOR(*prufer)[k]; /* parent of u */ in igraph_from_prufer()
H A Dgames.c4689 igraph_vector_int_t prufer; in igraph_i_tree_game_prufer() local
4696 IGRAPH_CHECK(igraph_vector_int_init(&prufer, n - 2)); in igraph_i_tree_game_prufer()
4697 IGRAPH_FINALLY(igraph_vector_int_destroy, &prufer); in igraph_i_tree_game_prufer()
4702 VECTOR(prufer)[i] = RNG_INTEGER(0, n - 1); in igraph_i_tree_game_prufer() local
4707 IGRAPH_CHECK(igraph_from_prufer(graph, &prufer)); in igraph_i_tree_game_prufer()
4709 igraph_vector_int_destroy(&prufer); in igraph_i_tree_game_prufer()
/dports/print/latex2rtf/latex2rtf-2.3.17/test/
H A Dbib_authordate.tex187 \dots\ \cite{prufer-64} \dots\\
554 \bibitem[\protect\citename{Prufer, }1964]{prufer-64}
/dports/math/py-sympy/sympy-1.9/doc/cheatsheet/
H A Dcombinatoric_cheatsheet.tex681 Path: \verb!sympy.combinatorics.prufer.Prufer!\\
728 \verb!static to_tree(prufer)!\\
/dports/math/py-networkx/networkx-2.6.3/doc/release/
H A Drelease_2.4.rst177 - Linear prufer coding (#3535)
/dports/textproc/bibclean/bibclean-3.06/test/okay/
H A Dtestscr1.bbl388 \bibitem{prufer-64}

12