/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_from_prufer.c | 12 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 D | igraph_to_prufer.c | 31 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 D | tree.c | 37 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 D | prufer.c | 53 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 D | prufer.rst | 1 .. _combinatorics-prufer: 6 .. module:: diofant.combinatorics.prufer
|
H A D | index.rst | 16 prufer
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/combinatorics/ |
H A D | prufer.rst | 1 .. _combinatorics-prufer: 6 .. module:: sympy.combinatorics.prufer
|
H A D | index.rst | 17 prufer.rst
|
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/ |
H A D | prufer.py | 192 def to_tree(prufer): argument 217 n = len(prufer) + 2 219 for p in prufer: 221 for i in prufer:
|
H A D | __init__.py | 2 from sympy.combinatorics.prufer import Prufer
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/combinatorics/ |
H A D | prufer.py | 187 def to_tree(prufer): argument 211 n = len(prufer) + 2 213 for p in prufer: 215 for i in prufer:
|
H A D | __init__.py | 16 from .prufer import Prufer
|
/dports/math/igraph/igraph-0.9.5/include/ |
H A D | igraph_conversion.h | 62 IGRAPH_EXPORT int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t *prufer);
|
H A D | igraph_constructors.h | 57 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 D | igraph_conversion.h | 62 DECLDIR int igraph_to_prufer(const igraph_t *graph, igraph_vector_int_t *prufer);
|
H A D | igraph_constructors.h | 56 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 D | test_prufer.py | 1 from sympy.combinatorics.prufer import Prufer
|
/dports/math/igraph/igraph-0.9.5/src/misc/ |
H A D | conversion.c | 922 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 D | conversion.c | 880 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 D | structure_generators.c | 2400 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 D | games.c | 4689 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 D | bib_authordate.tex | 187 \dots\ \cite{prufer-64} \dots\\ 554 \bibitem[\protect\citename{Prufer, }1964]{prufer-64}
|
/dports/math/py-sympy/sympy-1.9/doc/cheatsheet/ |
H A D | combinatoric_cheatsheet.tex | 681 Path: \verb!sympy.combinatorics.prufer.Prufer!\\ 728 \verb!static to_tree(prufer)!\\
|
/dports/math/py-networkx/networkx-2.6.3/doc/release/ |
H A D | release_2.4.rst | 177 - Linear prufer coding (#3535)
|
/dports/textproc/bibclean/bibclean-3.06/test/okay/ |
H A D | testscr1.bbl | 388 \bibitem{prufer-64}
|