Home
last modified time | relevance | path

Searched refs:tree_repr (Results 1 – 6 of 6) sorted by relevance

/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/tests/
H A Dtest_prufer.py18 assert a.tree_repr == [[2, 4], [1, 4], [1, 3], [0, 5], [0, 4]]
28 assert Prufer(tree).tree_repr == tree_lists
29 assert sorted(Prufer(set(tree)).tree_repr) == sorted(tree_lists)
41 assert b.tree_repr == [[0, 2], [0, 1], [1, 3]]
49 a = sorted(t.tree_repr)
52 assert sorted(Prufer(b).tree_repr) == a
/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/combinatorics/
H A Dtest_prufer.py22 assert a.tree_repr == [[2, 4], [1, 4], [1, 3], [0, 5], [0, 4]]
32 assert Prufer(tree).tree_repr == tree_lists
33 assert sorted(Prufer(set(tree)).tree_repr) == sorted(tree_lists)
51 a = sorted(t.tree_repr)
54 assert sorted(Prufer(b).tree_repr) == a
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/
H A Dprufer.py57 def tree_repr(self): member in Prufer
/dports/math/py-Diofant/Diofant-0.13.0/diofant/combinatorics/
H A Dprufer.py57 def tree_repr(self): member in Prufer
/dports/biology/hyphy/hyphy-2.5.33/src/core/
H A Dtopology.cpp3525 _String * tree_repr = nil; in SplitsIdentity() local
3628 tree_repr = ConvertFromPSW (nameMap, psw2); in SplitsIdentity()
3647 resultList->MStore ("CONSENSUS", tree_repr ? new _FString (tree_repr) : new _FString(), false); in SplitsIdentity()
/dports/math/py-sympy/sympy-1.9/doc/cheatsheet/
H A Dcombinatoric_cheatsheet.tex733 \verb!tree_repr!\\